Zobrazeno 1 - 10
of 570
pro vyhledávání: '"Ciardo P"'
Autor:
Ciardo, Federico, Viesca, Robert C.
We present a non-linear stability analysis of quasi-static slip in a spring-block model. The sliding interface is governed by rate- and state-dependent friction, with an intermediate state evolution law that spans between aging and slip laws using a
Externí odkaz:
http://arxiv.org/abs/2407.16846
Autor:
Ciardo, Lorenzo, Živný, Stanislav
We connect the mixing behaviour of random walks over a graph to the power of the local-consistency algorithm for the solution of the corresponding constraint satisfaction problem (CSP). We extend this connection to arbitrary CSPs and their promise va
Externí odkaz:
http://arxiv.org/abs/2406.19685
Autor:
Ciardo, Lorenzo
Information-processing tasks modelled by homomorphisms between relational structures can witness quantum advantage when entanglement is used as a computational resource. We prove that the occurrence of quantum advantage is determined by the same type
Externí odkaz:
http://arxiv.org/abs/2404.13186
Autor:
Ciardo, Lorenzo, Živný, Stanislav
We introduce a relaxation for homomorphism problems that combines semidefinite programming with linear Diophantine equations, and propose a framework for the analysis of its power based on the spectral theory of association schemes. We use this frame
Externí odkaz:
http://arxiv.org/abs/2311.00882
The 1-in-3 and Not-All-Equal satisfiability problems for Boolean CNF formulas are two well-known NP-hard problems. In contrast, the promise 1-in-3 vs. Not-All-Equal problem can be solved in polynomial time. In the present work, we investigate this co
Externí odkaz:
http://arxiv.org/abs/2302.03456
Autor:
Ciardo, Federico, Lecampion, Brice
We investigate the problem of fluid injection at constant pressure in a 2D Discrete Fracture Network (DFN) with randomly oriented and uniformly distributed frictionally-stable fractures. We show that this problem shares similarities with the simpler
Externí odkaz:
http://arxiv.org/abs/2212.01050
Autor:
Ciardo, Lorenzo, Živný, Stanislav
We show that approximate graph colouring is not solved by the lift-and-project hierarchy for the combination of linear programming and linear Diophantine equations. The proof is based on combinatorial tensor theory.
Comment: Full version of a ST
Comment: Full version of a ST
Externí odkaz:
http://arxiv.org/abs/2211.03168
Autor:
Ciardo, Lorenzo, Živný, Stanislav
We show that approximate graph colouring is not solved by any level of the affine integer programming (AIP) hierarchy. To establish the result, we translate the problem of exhibiting a graph fooling a level of the AIP hierarchy into the problem of co
Externí odkaz:
http://arxiv.org/abs/2210.08293
Autor:
Ciardo, Lorenzo, Živný, Stanislav
We provide a unified framework to study hierarchies of relaxations for Constraint Satisfaction Problems and their Promise variant. The idea is to split the description of a hierarchy into an algebraic part, depending on a minion capturing the "base l
Externí odkaz:
http://arxiv.org/abs/2207.02277
Autor:
Stefania Guida, Claudia Lasagni, Silvana Ciardo, Francesca Farnetani, Caterina Longo, Giovanni Pellacani
Publikováno v:
Dermatology Practical & Conceptual, Vol 14, Iss 3 (2024)
Externí odkaz:
https://doaj.org/article/ee1ce92d02164058b74eea8a38b40892
