Cover Image

Eulerian orientations and Hadamard codes: A novel connection via counting

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shao, Shuai, Tang, Zhuxiao
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity F.0
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

New Planar Algorithms and a Full Complexity Classification of the Eight-Vertex Model
by: Fan, Austen, et al.
Published: (2026)

A Note On The Natural Range Of Unambiguous-SAT
by: Pay, Tayfun
Published: (2023)

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

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

Constructibility and the P versus NP problem
by: Hole, Arne
Published: (2024)

Complexity of Unambiguous Problems in $Σ^P_2$
by: Gilboa, Matan, et al.
Published: (2025)

Condensing and Extracting Against Online Adversaries
by: Chattopadhyay, Eshan, et al.
Published: (2024)

Max-Cut with $ε$-Accurate Predictions
by: Cohen-Addad, Vincent, et al.
Published: (2024)

QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more
by: Chen, Yanlin, et al.
Published: (2023)

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

Simple Stochastic Stopping Games: A Generator and Benchmark Library
by: Rudich, Avi, et al.
Published: (2024)

Structure-Guided Automated Reasoning
by: Bannach, Max, et al.
Published: (2023)

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

Small Shadow Partitions
by: Kopparty, Swastik, et al.
Published: (2024)

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
by: Lokshtanov, Daniel, et al.
Published: (2024)

On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games
by: Cheval, Vincent, et al.
Published: (2025)

A Theory for Probabilistic Polynomial-Time Reasoning
by: Chen, Lijie, et al.
Published: (2026)

Verification Cost Asymmetry in Cognitive Warfare: A Complexity-Theoretic Framework
by: Luberisse, Joshua
Published: (2025)

An Optimal Randomized Algorithm for Finding the Saddlepoint
by: Dallant, Justin, et al.
Published: (2024)

Program Analysis via Multiple Context Free Language Reachability
by: Conrado, Giovanna Kobus, et al.
Published: (2024)

A Theoretical Computer Science Perspective on Free Will
by: Blum, Manuel, et al.
Published: (2022)

Replicability in High Dimensional Statistics
by: Hopkins, Max, et al.
Published: (2024)

Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
by: Chauhan, Archit, et al.
Published: (2026)

On the formalization of the notion of an algorithm
by: Middelburg, C. A.
Published: (2024)

Descriptive complexity for neural networks via Boolean networks
by: Ahvonen, Veeti, et al.
Published: (2023)

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

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

On the formalization of the notion of a concurrent algorithm
by: Middelburg, C. A.
Published: (2024)

Formalizing the notions of non-interactive and interactive algorithms
by: Middelburg, C. A.
Published: (2024)

I/O complexity and pebble games with partial computations
by: Sobczyk, Aleksandros
Published: (2024)

Smaller Depth-2 Linear Circuits for Disjointness Matrices
by: Ye, Lixi
Published: (2026)

Improved Bounds for Coin Flipping, Leader Election, and Random Selection
by: Chattopadhyay, Eshan, et al.
Published: (2025)

On SAT information content, its polynomial-time solvability and fixed code algorithms
by: Drozdowski, Maciej
Published: (2024)

Pseudorandomness of the Sticky Random Walk
by: Anand, Emile, et al.
Published: (2023)

Pauli measurements are not optimal for single-copy tomography
by: Acharya, Jayadev, et al.
Published: (2025)

On the Computation of 2-Dimensional Recurrence Equations
by: Natale, Giuseppe
Published: (2024)

Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)

A universal bound on the space complexity of Directed Acyclic Graph computations
by: Bilardi, Gianfranco, et al.
Published: (2024)

Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting
by: Hemaspaandra, Lane A., et al.
Published: (2021)

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