Cover Image

On the Number of Quantifiers Needed to Define Boolean Functions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Carmosino, Marco, Fagin, Ronald, Immerman, Neil, Kolaitis, Phokion, Lenchner, Jonathan, Sengupta, Rik
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multi-Structural Games and Beyond
by: Carmosino, Marco, et al.
Published: (2023)

Parallel Play Saves Quantifiers
by: Carmosino, Marco, et al.
Published: (2024)

Who Wins the Multi-Structural Game?
by: Fagin, Ronald, et al.
Published: (2025)

Multi-Structural Games and Number of Quantifiers
by: Fagin, Ronald, et al.
Published: (2021)

Aspects of Coherence in Dependence Logic
by: Barlag, Timon, et al.
Published: (2026)

Model Counting for Dependency Quantified Boolean Formulas
by: Fung, Long-Hin, et al.
Published: (2025)

Characterizing Data Dependencies Then and Now
by: Kolaitis, Phokion G., et al.
Published: (2024)

On the consistency of stronger lower bounds for NEXP
by: Thapen, Neil
Published: (2025)

Logics with probabilistic team semantics and the Boolean negation
by: Hannula, Miika, et al.
Published: (2023)

Measuring Decidability as Related to Busy Beaver Numbers
by: Tandi, Gurpreet, et al.
Published: (2026)

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

Codd's Theorem for Databases over Semirings
by: Badia, Guillermo, et al.
Published: (2025)

Disjunctions of Two Dependence Atoms
by: Fröhlich, Nicolas, et al.
Published: (2025)

How to fit large complexity classes into TFNP
by: Thapen, Neil
Published: (2024)

Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
by: Pratt-Hartmann, Ian
Published: (2006)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
by: Nechesov, Andrey
Published: (2024)

Adaptive Query Algorithms for Relational Structures Based on Homomorphism Counts
by: Cate, Balder ten, et al.
Published: (2025)

The Unit Gap: How Sharing Works in Boolean Circuits
by: Krinkin, Kirill
Published: (2026)

Quantifier Elimination Meets Treewidth
by: Wu, Hao, et al.
Published: (2026)

Rice-like complexity lower bounds for Boolean and uniform automata networks
by: Goubault-Larrecq, Aliénor, et al.
Published: (2024)

What Juris Hartmanis taught me about Reductions
by: Immerman, Neil
Published: (2024)

A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
by: Baillot, Patrick, et al.
Published: (2024)

Polynomial Calculus sizes over the Boolean and Fourier bases are incomparable
by: Mouli, Sasank
Published: (2024)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
by: Atserias, Albert, et al.
Published: (2024)

Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)

An order out of nowhere: a new algorithm for infinite-domain CSPs
by: Mottet, Antoine, et al.
Published: (2023)

The Proof Analysis Problem
by: Arteche, Noel, et al.
Published: (2025)

Proof complexity of positive branching programs
by: Das, Anupam, et al.
Published: (2021)

Parallelism and Adaptivity in Student-Teacher Witnessing
by: Ježil, Ondřej, et al.
Published: (2026)

Effective Versions of Strong Measure Zero
by: Rayman, Matthew
Published: (2025)

The complete classification for quantified equality constraints
by: Zhuk, Dmitriy, et al.
Published: (2021)

Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)

Kleene algebra with commutativity conditions is undecidable
by: de Amorim, Arthur Azevedo, et al.
Published: (2024)

Set Descriptive Complexity of Solvable Functions
by: Gozzi, Riccardo, et al.
Published: (2024)

On the Unprovability of Circuit Size Bounds in Intuitionistic $\mathsf{S}^1_2$
by: Chen, Lijie, et al.
Published: (2024)

Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman
by: de Rezende, Susanna F., et al.
Published: (2024)

A SUBSET-SUM Characterisation of the A-Hierarchy
by: Gutleben, Jan, et al.
Published: (2024)

Graph Homomorphism, Monotone Classes and Bounded Pathwidth
by: Eagling-Vose, Tala, et al.
Published: (2024)

Finite Variable Counting Logics with Restricted Requantification
by: Raßmann, Simon, et al.
Published: (2024)

Epistemic Skills: Logical Dynamics of Knowing and Forgetting
by: Liang, Xiaolong, et al.
Published: (2024)