Image de couverture de livre

New Planar Algorithms and a Full Complexity Classification of the Eight-Vertex Model

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Fan, Austen, Cai, Jin-Yi, Shao, Shuai, Tang, Zhuxiao
Format:	Preprint
Publié:	2026
Sujets:	Computational Complexity F.0
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Eulerian orientations and Hadamard codes: A novel connection via counting
par: Shao, Shuai, et autres
Publié: (2024)

Complexity of Unambiguous Problems in $Σ^P_2$
par: Gilboa, Matan, et autres
Publié: (2025)

A Note On The Natural Range Of Unambiguous-SAT
par: Pay, Tayfun
Publié: (2023)

Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
par: Chauhan, Archit, et autres
Publié: (2026)

Realizable Circuit Complexity: Embedding Computation in Space-Time
par: Prada, Benjamin, et autres
Publié: (2025)

On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games
par: Cheval, Vincent, et autres
Publié: (2025)

Graph-Based Deterministic Polynomial Framwork for NP Problems
par: Lee, Changryeol
Publié: (2025)

Nonuniform Deterministic Finite Automata over finite algebraic structures
par: Idziak, Paweł M., et autres
Publié: (2025)

An Optimal Randomized Algorithm for Finding the Saddlepoint
par: Dallant, Justin, et autres
Publié: (2024)

Verification Cost Asymmetry in Cognitive Warfare: A Complexity-Theoretic Framework
par: Luberisse, Joshua
Publié: (2025)

Constructibility and the P versus NP problem
par: Hole, Arne
Publié: (2024)

Condensing and Extracting Against Online Adversaries
par: Chattopadhyay, Eshan, et autres
Publié: (2024)

QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more
par: Chen, Yanlin, et autres
Publié: (2023)

Max-Cut with $ε$-Accurate Predictions
par: Cohen-Addad, Vincent, et autres
Publié: (2024)

Completing the Complexity Classification of 2-Solo Chess: Knights and Kings are Hard
par: Kühn, Kolja, et autres
Publié: (2026)

A Note on the NP-Hardness of PARTITION Via First-Order Projections
par: Iturralde, Paúl Risco
Publié: (2025)

Structure-Guided Automated Reasoning
par: Bannach, Max, et autres
Publié: (2023)

Small Shadow Partitions
par: Kopparty, Swastik, et autres
Publié: (2024)

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Simple Stochastic Stopping Games: A Generator and Benchmark Library
par: Rudich, Avi, et autres
Publié: (2024)

Fair Vertex Problems Parameterized by Cluster Vertex Deletion
par: Masařík, Tomáš, et autres
Publié: (2025)

A Theory for Probabilistic Polynomial-Time Reasoning
par: Chen, Lijie, et autres
Publié: (2026)

Replicability in High Dimensional Statistics
par: Hopkins, Max, et autres
Publié: (2024)

A Theoretical Computer Science Perspective on Free Will
par: Blum, Manuel, et autres
Publié: (2022)

On the formalization of the notion of an algorithm
par: Middelburg, C. A.
Publié: (2024)

Planar Graph Homomorphisms: A Dichotomy and a Barrier from Quantum Groups
par: Cai, Jin-Yi, et autres
Publié: (2026)

On the formalization of the notion of a concurrent algorithm
par: Middelburg, C. A.
Publié: (2024)

On the Decidability of Verification under Release/Acquire
par: Conrado, Giovanna Kobus, et autres
Publié: (2026)

PosSLP and Sum of Squares
par: Bläser, Markus, et autres
Publié: (2024)

Program Analysis via Multiple Context Free Language Reachability
par: Conrado, Giovanna Kobus, et autres
Publié: (2024)

Formalizing the notions of non-interactive and interactive algorithms
par: Middelburg, C. A.
Publié: (2024)

Smaller Depth-2 Linear Circuits for Disjointness Matrices
par: Ye, Lixi
Publié: (2026)

I/O complexity and pebble games with partial computations
par: Sobczyk, Aleksandros
Publié: (2024)

Disjunctive Complexity
par: Ivanov, Nikita, et autres
Publié: (2025)

A Fine-Grained Complexity View on Propositional Abduction -- Algorithms and Lower Bounds
par: Lagerkvist, Victor, et autres
Publié: (2025)

On the Complexity of Determinations
par: Hellerstein, Joseph M.
Publié: (2026)

On the Complexity of Vertex-Splitting Into an Interval Graph
par: Abu-Khzam, Faisal N., et autres
Publié: (2026)

On the Complexity of Claw-Free Vertex Splitting
par: Abu-Khzam, Faisal N., et autres
Publié: (2025)

A Polynomial Time Algorithm for 3SAT
par: Quigley, Robert
Publié: (2024)

Improved Bounds for Coin Flipping, Leader Election, and Random Selection
par: Chattopadhyay, Eshan, et autres
Publié: (2025)