Image de couverture de livre

Effective Versions of Strong Measure Zero

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Rayman, Matthew
Format:	Preprint
Publié:	2025
Sujets:	Logic Computational Complexity Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Proof Analysis Problem
par: Arteche, Noel, et autres
Publié: (2025)

Meta-Mathematics of Computational Complexity Theory
par: Oliveira, Igor C.
Publié: (2025)

On the consistency of stronger lower bounds for NEXP
par: Thapen, Neil
Publié: (2025)

Measuring Decidability as Related to Busy Beaver Numbers
par: Tandi, Gurpreet, et autres
Publié: (2026)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
par: Nechesov, Andrey
Publié: (2024)

Proof Complexity of Linear Logics
par: Tabatabai, Amirhossein Akbar, et autres
Publié: (2026)

An order out of nowhere: a new algorithm for infinite-domain CSPs
par: Mottet, Antoine, et autres
Publié: (2023)

Proof complexity of positive branching programs
par: Das, Anupam, et autres
Publié: (2021)

Parallelism and Adaptivity in Student-Teacher Witnessing
par: Ježil, Ondřej, et autres
Publié: (2026)

The complete classification for quantified equality constraints
par: Zhuk, Dmitriy, et autres
Publié: (2021)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
par: Atserias, Albert, et autres
Publié: (2024)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
par: Zhuk, Dmitriy
Publié: (2024)

Measuring robustness of dynamical systems. Relating time and space to length and precision
par: Blanc, Manon, et autres
Publié: (2023)

Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations
par: Blanc, Manon, et autres
Publié: (2023)

On Probabilistic and Causal Reasoning with Summation Operators
par: Ibeling, Duligur, et autres
Publié: (2024)

Network Satisfaction Problems Solved by k-Consistency
par: Bodirsky, Manuel, et autres
Publié: (2023)

New Bounds for the Ideal Proof System in Positive Characteristic
par: Behera, Amik Raj, et autres
Publié: (2025)

On Deciding the Data Complexity of Answering Linear Monadic Datalog Queries with LTL Operators(Extended Version)
par: Artale, Alessandro, et autres
Publié: (2025)

Kleene algebra with commutativity conditions is undecidable
par: de Amorim, Arthur Azevedo, et autres
Publié: (2024)

Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems
par: Lemke, Caroline, et autres
Publié: (2025)

Better Extension Variables in DQBF via Independence
par: Chew, Leroy, et autres
Publié: (2025)

Discrete Homotopy and Promise Constraint Satisfaction Problem
par: Beikmohammadi, Arash, et autres
Publié: (2025)

Modular Counting CSP: Reductions and Algorithms
par: Kazeminia, Amirhossein, et autres
Publié: (2025)

On the Interplay of Cube Learning and Dependency Schemes in QCDCL Proof Systems
par: Choudhury, Abhimanyu, et autres
Publié: (2025)

Uniformity within Parameterized Circuit Classes
par: Hegeman, Steef, et autres
Publié: (2025)

Symmetric Proofs in the Ideal Proof System
par: Dawar, Anuj, et autres
Publié: (2025)

On Middle Grounds for Preference Statements
par: George, Anne-Marie, et autres
Publié: (2025)

Fagin's Theorem for Semiring Turing Machines
par: Badia, Guillermo, et autres
Publié: (2025)

Model Counting for Dependency Quantified Boolean Formulas
par: Fung, Long-Hin, et autres
Publié: (2025)

When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames
par: Krebs, Andreas, et autres
Publié: (2025)

Characterizing Small Circuit Classes from FAC^0 to FAC^1 via Discrete Ordinary Differential Equations
par: Antonelli, Melissa, et autres
Publié: (2025)

Logic and Computation through the Lens of Semirings
par: Barlag, Timon, et autres
Publié: (2025)

Structural Origin and the Minimal Syntax of NP-Hardness: Analysis of SAT from Syntactic Generativity and Compositional Collapse
par: Nishiyama, Yumiko
Publié: (2025)

Testing for Renamability to Classes of Clause Sets
par: Brandl, Albert, et autres
Publié: (2025)

Singleton algorithms for the Constraint Satisfaction Problem
par: Zhuk, Dmitriy
Publié: (2025)

Arity hierarchies for quantifiers closed under partial polymorphisms
par: Dawar, Anuj, et autres
Publié: (2025)

On the Complexity of the Skolem Problem at Low Orders
par: Bacik, Piotr, et autres
Publié: (2025)

On the Number of Quantifiers Needed to Define Boolean Functions
par: Carmosino, Marco, et autres
Publié: (2024)

On the Unprovability of Circuit Size Bounds in Intuitionistic $\mathsf{S}^1_2$
par: Chen, Lijie, et autres
Publié: (2024)

Complexity classification of counting graph homomorphisms modulo a prime number
par: Bulatov, Andrei A., et autres
Publié: (2021)