Succinct ordering and aggregation constraints in algebraic array theories

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Interface stress is a fundamental descriptor for interphase boundaries and is defined in strict relation to the interface energy. In nanomultilayers with their intrinsically high interface density, the functional properties are dictated by the interface st ...

We study the proof theory and algorithms for orthologic, a logical system based on ortholattices, which have shown practical relevance in simplification and normalization of verification conditions. Ortholattices weaken Boolean algebras while having polyno ...

Byzantine agreement, arguably the most fundamental problem in distributed computing, operates among n processes, out of which t < n can exhibit arbitrary failures. The problem states that all correct (non-faulty) processes must eventually decide (terminati ...

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

The task of discovering equivalent entities in knowledge graphs (KGs), so-called KG entity alignment, has drawn much attention to overcome the incompleteness problem of KGs. The majority of existing techniques learns the pointwise representations of entiti ...

Thermonanophotonics, that is the study of photothermal effects in optical nanoantennas, has recently attracted growing interest. In particular, going beyond thermoplasmonic designs, thermo-optical modulation of dielectric nanoantennas opens new opportuniti ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

In 1970, Furth and Yoshikawa (1970 Phys. Fluids 13 2593-6) introduced the scalings of adiabatic plasma compression. Basically, if the shape of the external plasma boundary and the aspect ratio are preserved during the compression, then the density, kinetic ...

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

We study the computational complexity of the optimal transport problem that evaluates the Wasser- stein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in th ...

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

The Transfer Matrix formalism is ubiquitous when it comes to study wave propagation in various stratified media, applications ranging from Seismology to Quantum Mechanics. A relation between variables at two points in two different layers can be establishe ...

We show that the satisfiability problem for the quantifier-free theory of product structures with the equicardinality relation is inNP. As an application, we extend the combinatory array logic fragmentto handle cardinality constraints. The resulting fragme ...

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

Interactive oracle proofs (IOPs) are a multi-round generalization of probabilistically checkable proofs that play a fundamental role in the construction of efficient cryptographic proofs. ...

The present invention proposes a method for producing an authenticable moiré shape that simultaneously moves and shows a beating effect. The method relies on a combination of the 1D or the 2D moiré and the level line moiré. When tilting a compound showing ...

A motif is a frequently occurring subgraph of a given directed or undirected graph G (Milo et al.). Motifs capture higher order organizational structure of G beyond edge relationships, and, therefore, have found wide applications such as in graph clusterin ...

We show that Cutting Planes (CP) proofs are hard to find: Given an unsatisfiable formula F, It is -hard to find a CP refutation of F in time polynomial in the length of the shortest such refutation; and unless Gap-Hitting-Set admits a nontrivial algorithm, ...

The Kunsthal in Rotterdam is a key work in the oeuvre of OMA/Rem Koolhaas that marks the threshold between the firmâ s architectural production of the decades before and after 1990. This doctoral thesis aims at a deeper and comprehensive understanding of ...

Succinct ordering and aggregation constraints in algebraic array theories

Chattez avec Graph Search

Experimental and ab initio derivation of interface stress in nanomultilayered coatings: Application to immiscible Cu/W system with variable in-plane stress

Orthologic with Axioms

All Byzantine Agreement Problems Are Expensive

Approximation Algorithms for Allocation and Network Design

Complex Representation Learning with Graph Convolutional Networks for Knowledge Graph Alignment

Light-Driven Thermo-Optical Effects in Nanoresonator Arrays

Results on Sparse Integer Programming and Geometric Independent Sets

Shafranov shift correction to the Furth-Yoshikawa scaling of tokamak adiabatic compression

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Discrete Optimal Transport with Independent Marginals is #P-Hard

The double exponential runtime is tight for 2-stage stochastic ILPs

Harmonic decomposition of the trace of 1D transfer matrices in layered media

NP Satisfiability for Arrays as Powers

Formula Normalizations in Verification

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Synthesis of moving and beating moiré shapes

Motif Cut Sparsifiers

Automating cutting planes is NP-hard

Inventory of Problems: The Genesis of the Rotterdam Kunsthal by OMA/Rem Koolhaas, 1987-1992