Imagen de Portada

Characterizing Small Circuit Classes from FAC^0 to FAC^1 via Discrete Ordinary Differential Equations

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Antonelli, Melissa, Durand, Arnaud, Kontinen, Juha
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

Solvable Initial Value Problems Ruled by Discontinuous Ordinary Differential Equations
por: Bournez, Olivier, et al.
Publicado: (2024)

The flattening operator in team-based logics
por: Durand, Arnaud, et al.
Publicado: (2025)

Logic and Computation through the Lens of Semirings
por: Barlag, Timon, et al.
Publicado: (2025)

Uniformity within Parameterized Circuit Classes
por: Hegeman, Steef, et al.
Publicado: (2025)

On the expressive power of inquisitive team logic and inquisitive first-order logic
por: Kontinen, Juha, et al.
Publicado: (2026)

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

Optimal Lower Bounds for Symmetric Modular Circuits
por: Pago, Benedikt
Publicado: (2026)

Testing for Renamability to Classes of Clause Sets
por: Brandl, Albert, et al.
Publicado: (2025)

Discrete Homotopy and Promise Constraint Satisfaction Problem
por: Beikmohammadi, Arash, et al.
Publicado: (2025)

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

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

A Simple Constructive Bound on Circuit Size Change Under Truth Table Perturbation
por: Krinkin, Kirill
Publicado: (2026)

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

Recursion and proof theoretical characterizations of small circuit classes with modulo counting via discrete differential equations (long version)
por: Antonelli, Melissa, et al.
Publicado: (2026)

A Remark on the Expressivity of Asynchronous TeamLTL and HyperLTL
por: Kontinen, Juha, et al.
Publicado: (2024)

The Proof Analysis Problem
por: Arteche, Noel, et al.
Publicado: (2025)

Effective Versions of Strong Measure Zero
por: Rayman, Matthew
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

Better Extension Variables in DQBF via Independence
por: Chew, Leroy, et al.
Publicado: (2025)

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

Devil's Games and $\text{Q}\mathbb{R}$: Continuous Games complete for the First-Order Theory of the Reals
por: Meijer, Lucas, et al.
Publicado: (2025)

Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras
por: Barto, Libor, et al.
Publicado: (2021)

Small unsatisfiable $k$-CNFs with bounded literal occurrence
por: Zhang, Tianwei, et al.
Publicado: (2024)

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

Program Synthesis is $Σ_3^0$-Complete
por: Kim, Jinwoo
Publicado: (2024)

Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems
por: Lemke, Caroline, et al.
Publicado: (2025)

Modular Counting CSP: Reductions and Algorithms
por: Kazeminia, Amirhossein, et al.
Publicado: (2025)

On the Interplay of Cube Learning and Dependency Schemes in QCDCL Proof Systems
por: Choudhury, Abhimanyu, et al.
Publicado: (2025)