Suchergebnisse - Theory of computation- Algebraic complexity theory

On Solving Sparse Polynomial Factorization Related Problems von Bisht, Pranav, Volkovich, Ilya

“… In a recent result of Bhargava, Saraf and Volkovich [FOCS’18; JACM’20], the first factor sparsity bound for constant individual degree polynomials was shown …”
Volltext

Characterizing Valiant's algebraic complexity classes von Malod, Guillaume, Portier, Natacha

“… Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families …”
Volltext

Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all frames von Verbrugge, Rineke

“… It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of …”
Volltext

Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP von Barto, Libor, Brady, Zarathustra, Bulatov, Andrei, Kozik, Marcin, Zhuk, Dmitriy

“… This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP …”
Volltext

Efficient Computation of a Semi-Algebraic Basis of the First Homology Group of a Semi-Algebraic Set von Basu, Saugata, Percival, Sarah

“… ) . This algorithm generalizes well known algorithms having singly exponential complexity for computing a semi-algebraic basis of the zeroth homology group of semi-algebraic sets, which is equivalent …”
Volltext

CoqPilot, a plugin for LLM-based generation of proofs von Kozyrev, Andrei, Solovev, Gleb, Khramov, Nikita, Podkopaev, Anton

“… We present CoqPilot, a VS Code extension designed to help automate writing of Coq proofs. The plugin collects the parts of proofs marked with the admit tactic …”
Volltext

On the logical structure of choice and bar induction principles von Brede, Nuria, Herbelin, Hugo

“… We develop an approach to choice principles and their contrapositive bar-induction principles as extensionality schemes connecting an "intensional" or …”
Volltext

Categorical models of Linear Logic with fixed points of formulas von Ehrhard, Thomas, Jafarrahmani, Farzad

“… We develop a categorical semantics of µLL, a version of propositional Linear Logic with least and greatest fixed points extending David Baelde's propositional …”
Volltext

Accelerating All-SAT Computation with Short Blocking Clauses von Zhang, Yueling, Pu, Geguang, Sun, Jun

“… The All-SAT (All-SATisfiable) problem focuses on finding all satisfiable assignments of a given propositional formula, whose applications include model …”
Volltext

Constraint Satisfaction Problems over Finite Structures von Barto, Libor, DeMeo, William, Mottet, Antoine

“… We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP …”
Volltext

Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits von Limaye, Nutan, Srinivasan, Srikanth, Tavenas, Sebastien

“… An Algebraic Circuit for a polynomial P\ \ \in \mathbb{F}[x_{1}, \ldots, x_{N}] is a computational model for constructing the polynomial P using only additions and multiplications …”
Volltext

Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics von Balasubramanian, A. R., Lang, Timo, Ramanayake, Revantha

“… . Decidability for the corresponding extensions of its contraction counterpart FL ec was established recently but their computational complexity was left unanswered …”
Volltext

Combinatorial Proofs and Decomposition Theorems for First-order Logic von Hughes, Dominic J. D., Strasburger, Lutz, Wu, Jui-Hsuan

“… We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in …”
Volltext

Parameterized Complexity of Elimination Distance to First-Order Logic Properties von Fomin, Fedor V., Golovach, Petr A., Thilikos, Dimitrios M.

“… The elimination distance to some target graph property {\mathcal{P}} is a general graph modification parameter introduced by Bulian and Dawar. We initiate the …”
Volltext

Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness von Dörfler, Julian, Roth, Marc, Schmitt, Johannes, Wellnitz, Philip

“… We study the problem # I N D S U B ( Φ ) of counting all induced subgraphs of size k in a graph G that satisfy the property Φ . It is shown that, given any …”
Volltext

Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments von Jung, Jean Christoph, Wolter, Frank

“… In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication. In …”
Volltext

Higher Lenses von Capriotti, Paolo, Danielsson, Nils Anders, Vezzosi, Andrea

“… We show that total, very well-behaved lenses are not very well-behaved when treated proof-relevantly in the setting of homotopy type theory/univalent foundations …”
Volltext

First-Order Reasoning and Efficient Semi-Algebraic Proofs von Part, Fedor, Thapen, Neil, Tzameret, Iddo

“… Specifically, we develop first-order theories that capture in a precise manner constant degree algebraic and semi-algebraic proof systems …”
Volltext

An Algebraic Theory of Complexity for Discrete Optimization von Cohen, David A., Cooper, Martin C., Creed, Páidí, Jeavons, Peter G., Živný, Stanislav

“… Here we present a unifying theory of complexity for problems of this kind. We show that the complexity of a finite-domain discrete optimization problem …”
Volltext

Some Complete and Intermediate Polynomials in Algebraic Complexity Theory von Mahajan, Meena, Saurabh, Nitin

“… We provide a list of new natural VNP-intermediate polynomial families, based on basic (combinatorial) NP-complete problems that are complete under parsimonious …”
Volltext