Imagen de Portada

Constructive Cavity Method

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Franchini, Simone
Formato:	Preprint
Publicado:	2026
Materias:	Statistical Mechanics 82D30, 60F10 F.1.3; F.2.0; F.2.3
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Pure States of the Replica Symmetry Breaking ansatz
por: Franchini, Simone
Publicado: (2025)

REM universality for linear random energy
por: Concetti, Francesco, et al.
Publicado: (2026)

Constructibility and the P versus NP problem
por: Hole, Arne
Publicado: (2024)

Modelling Distributed Applications with Mixed-Choice Stateful Typestates
por: Parrinha, Francisco, et al.
Publicado: (2026)

Graph-Based Deterministic Polynomial Framwork for NP Problems
por: Lee, Changryeol
Publicado: (2025)

Nonuniform Deterministic Finite Automata over finite algebraic structures
por: Idziak, Paweł M., et al.
Publicado: (2025)

Serial Properties, Selector Proofs, and the Provability of Consistency
por: Artemov, Sergei
Publicado: (2024)

Non-Compact Proofs
por: Artemov, Sergei
Publicado: (2025)

Consistency formula is strictly stronger in PA than PA-consistency
por: Artemov, Sergei
Publicado: (2025)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
por: de Rezende, Susanna F., et al.
Publicado: (2019)

OnlineProver: Experience with a Visualisation Tool for Teaching Formal Proofs
por: Perháč, Ján, et al.
Publicado: (2025)

Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations
por: Antonelli, Melissa, et al.
Publicado: (2025)

Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
por: de Rezende, Susanna F., et al.
Publicado: (2026)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
por: Conneryd, Jonas, et al.
Publicado: (2025)

On bounded depth proofs for Tseitin formulas on the grid; revisited
por: Håstad, Johan, et al.
Publicado: (2022)

Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients
por: de Rezende, Susanna F., et al.
Publicado: (2024)

Supercritical Tradeoffs for Monotone Circuits
por: Göös, Mika, et al.
Publicado: (2024)

Semi-interval Comparison Constraints in Query Containment and Their Impact on Certain Answer Computation
por: Afrati, Foto N., et al.
Publicado: (2025)

H-theorem do-conjecture
por: Süzen, Mehmet
Publicado: (2023)

PosSLP and Sum of Squares
por: Bläser, Markus, et al.
Publicado: (2024)

Separation of PSPACE and EXP
por: Czerwinski, Reiner
Publicado: (2021)

Random Polymers and Generalized Urn Processes
por: Franchini, Simone, et al.
Publicado: (2018)

CLIQUE as an AND of Polynomial-Sized Monotone Constant-Depth Circuits
por: Bodnar, Levente
Publicado: (2024)

Regular structures of an intractable enumeration problem: a diagonal recurrence relation of monomer-polymer coverings on two-dimensional rectangular lattices
por: Kong, Yong
Publicado: (2024)

The Fractal Logic of Phi-adic Recursion
por: Rosko, Milan
Publicado: (2025)

Alpay Algebra II: Identity as Fixed-Point Emergence in Categorical Data
por: Alpay, Faruk
Publicado: (2025)

On the Decidability of Verification under Release/Acquire
por: Conrado, Giovanna Kobus, et al.
Publicado: (2026)

Formula Size-Depth Tradeoffs for Iterated Sub-Permutation Matrix Multiplication
por: Rossman, Benjamin
Publicado: (2024)

Peek2: Regex-free Byte-level Byte-Pair Encoding Pretokenizer for LLM Inference on Edge Devices
por: Zai, Liu, et al.
Publicado: (2026)

Adversarial Barrier in Uniform Class Separation
por: Rosko, Milan
Publicado: (2025)

Imperative process algebra and models of computation
por: Middelburg, C. A.
Publicado: (2022)

Summa Summarum: Moessner's Theorem without Dynamic Programming
por: Danvy, Olivier
Publicado: (2024)

Catene ideali con numero fissato di auto-intersezioni
por: Franchini, Simone
Publicado: (2024)

Probabilistic imperative process algebra
por: Middelburg, C. A.
Publicado: (2026)

Complementing an imperative process algebra with a rely/guarantee logic
por: Middelburg, C. A.
Publicado: (2025)

Quantum Sabotage Complexity
por: Cornelissen, Arjan, et al.
Publicado: (2024)

Realizable Circuit Complexity: Embedding Computation in Space-Time
por: Prada, Benjamin, et al.
Publicado: (2025)

Min-CSPs on Complete Instances
por: Anand, Aditya, et al.
Publicado: (2024)

Recurrence solution of monomer-polymer models on two-dimensional rectangular lattices
por: Kong, Yong
Publicado: (2024)

An SoS Entropy Dichotomy via Windowed Hypercontractivity
por: Lela, Marko
Publicado: (2025)