Image de couverture de livre

A Physical Analogy between Molecular Ordering and SAT-to-Ising Annealing

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dubey, ShivKishan, Sharma, Rohit
Format:	Preprint
Publié:	2025
Sujets:	Logic in Computer Science 68Q17
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Unifying lower bounds for algebraic machines, semantically
par: Seiller, Thomas, et autres
Publié: (2018)

Undefinability of Approximation of 2-to-2 Games
par: Dawar, Anuj, et autres
Publié: (2025)

SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks
par: Marković, Petar, et autres
Publié: (2026)

An MDL-Style Cost Functional KC, Distribution-Preserving Reductions ($A2^d$), and an $AC^0$+log Lower Bound for 3SAT via Balanced 3XOR
par: Lela, Marko
Publié: (2025)

Ineffectiveness for Search and Undecidability of PCSP Meta-Problems
par: Larrauri, Alberto
Publié: (2025)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
par: Dorochko, Leonid, et autres
Publié: (2026)

The equational theory of the Weihrauch lattice with multiplication
par: Neumann, Eike, et autres
Publié: (2024)

The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms
par: Kátay, Tamás, et autres
Publié: (2023)

Finitely (In)tractable Promise Constraint Satisfaction Problems
par: Asimi, Kristina, et autres
Publié: (2020)

Finitely Bounded Homogeneity Turned Inside-Out
par: Rydval, Jakub
Publié: (2021)

Quantifying The Limits of AI Reasoning: Systematic Neural Network Representations of Algorithms
par: Kratsios, Anastasis, et autres
Publié: (2025)

Game Comonads & Generalised Quantifiers
par: Conghaile, Adam Ó, et autres
Publié: (2020)

Languages given by Finite Automata over the Unary Alphabet
par: Czerwiński, Wojciech, et autres
Publié: (2023)

A Constructive Proof of Rice's Theorem and the Halting Problem via Hilbert's Tenth Problem
par: Brossard, Jonathan
Publié: (2026)

A Formalization of Abstract Rewriting in Agda
par: Arkle, Sam, et autres
Publié: (2026)

A Complete Fragment of LTL(EB)
par: Ferrarotti, Flavio, et autres
Publié: (2024)

Behavioural Theory of Reflective Algorithms II: Reflective Parallel Algorithms
par: Schewe, Klaus-Dieter, et autres
Publié: (2025)

Choiceless Polynomial Space
par: Ferrarotti, Flavio, et autres
Publié: (2024)

Hyperfiniteness on Topological Ramsey Spaces
par: Bursics, Balázs, et autres
Publié: (2024)

There is a deep 1-generic set
par: Li, Ang
Publié: (2024)

Recursive windows for grammar logics of bounded density
par: Gasquet, Olivier
Publié: (2025)

PSPACE-completeness of bimodal transitive weak-density logic
par: Balbiani, Philippe, et autres
Publié: (2025)

Curved Boolean Logic: A Contextual Generalization of Propositional Logic with Algorithmic Consequences
par: von Liechtenstein, Maximilian R. P.
Publié: (2025)

RustyDL: A Program Logic for Rust
par: Drodt, Daniel, et autres
Publié: (2026)

Complexities of Well-Quasi-Ordered Substructural Logics
par: Galatos, Nikolaos, et autres
Publié: (2025)

Some derivations among Logarithmic Space Bounded Counting Classes
par: Janaki, V., et autres
Publié: (2023)

Composing Codensity Bisimulations
par: Kori, Mayuko, et autres
Publié: (2024)

Grothendieck Topologies and Sheaf-Theoretic Foundations of Cryptographic Security: Attacker Models and $Σ$-Protocols as the First Step
par: Inoué, Takao
Publié: (2026)

A "Symbolic" Representation of Object-Nets (Extended Version)
par: Köhler-Bussmeier, Michael, et autres
Publié: (2024)

Polynomial Identity Testing via Evaluation of Rational Functions
par: Hu, Ivan, et autres
Publié: (2022)

Flexible constraint satisfiability and a problem in semigroup theory
par: Jackson, Marcel
Publié: (2015)

Cone-Induced Observation Congruences for Vector-Valued Quantitative Languages
par: Alpay, Faruk, et autres
Publié: (2026)

The Separation of $NP$ and $PSPACE$
par: Lin, Tianrong
Publié: (2021)

Constraint satisfaction problems, compactness and non-measurable sets
par: Tardif, Claude
Publié: (2025)

On Equivalent Characterizations of NP in Abstract Models of Computation
par: Kirn, Jeremy C., et autres
Publié: (2025)

Monitoring Hyperproperties over Observed and Constructed Traces
par: Chalupa, Marek, et autres
Publié: (2025)

On the incomputability of computable dimension
par: Staiger, Ludwig
Publié: (2019)

Termination of Innermost-Terminating Right-Linear Overlay Term Rewrite Systems (Full Version)
par: Nishida, Naoki
Publié: (2026)

Rewriting Induction for Existentially Quantified Equations in Logically Constrained Rewriting (Full Version)
par: Nishida, Naoki, et autres
Publié: (2026)

Place Bisimilarity is Decidable, Indeed!
par: Gorrieri, Roberto
Publié: (2021)