Results 11 to 20 of about 236,217 (313)
The Complexity of Propositional Proofs
Bulletin of Symbolic Logic, 2007 AbstractPropositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms.
Nathan Segerlind
semanticscholar +3 more sources
On the complexity of branching proofs
35th Computational Complexity Conference (CCC 2020), 2020 We consider the task of proving integer infeasibility of a bounded convex K in Rn using a general branching proof system. In a general branching proof, one constructs a branching tree by adding an integer disjunction ax ≤ b or ax ≥ b + 1, a ∈ Zn, at each
D. Dadush, Samarth Tiwari
semanticscholar +7 more sources
Generic Modal Cut Elimination Applied to Conditional Logics [PDF]
Logical Methods in Computer Science, 2011 We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide
Dirk Pattinson, Lutz Schröder
doaj +3 more sources
Complexity of Null-and Positivstellensatz proofs
Annals of Pure and Applied Logic, 2001 We introduce two versions of proof systems dealing with systems of inequalities: Positivstellensatz refutations and Positivstellensatz calculus. For both systems we prove the lower bounds on degrees and lengths of derivations for the example due to Lazard, Mora and Philippon.
D. Grigoriev, Nicolai N. Vorobjov
semanticscholar +5 more sources
Certification of Complexity Proofs using CeTA [PDF]
, 2015 Nowadays certification is widely employed by automated termination tools for term rewriting, where certifiers support most available techniques. In complexity analysis, the situation is quite different.
Avanzini, Martin, Sternagel, Christian
core +6 more sources
Proof Complexity of Modal Resolution [PDF]
Journal of Automated Reasoning, 2021 AbstractWe investigate the proof complexity of modal resolution systems developed by Nalon and Dixon (J Algorithms 62(3–4):117–134, 2007) and Nalon et al. (in: Automated reasoning with analytic Tableaux and related methods—24th international conference, (TABLEAUX’15), pp 185–200, 2015), which form the basis of modal theorem proving (Nalon et al., in ...
Sarah Sigley, Olaf Beyersdorff
openaire +2 more sources
Quantum-inspired permanent identities [PDF]
Quantum, 2022 The permanent is pivotal to both complexity theory and combinatorics. In quantum computing, the permanent appears in the expression of output amplitudes of linear optical computations, such as in the Boson Sampling model.
Ulysse Chabaud +2 more
doaj +1 more source
Quantum Proofs of Proximity [PDF]
Quantum, 2022 We initiate the systematic study of QMA algorithms in the setting of property testing, to which we refer as QMA $\textit{proofs of proximity}$ (QMAPs).
Marcel Dall'Agnol +3 more
doaj +1 more source
Efficient inner product arguments and their applications in range proofs
IET Information Security, 2023 Inner product arguments allow a prover to prove that the inner product of two committed vectors equals a public scalar. They are used to reduce the complexity of many cryptographic primitives, such as range proofs.
Zibo Zhou +4 more
doaj +1 more source
Certificate complexity and symmetry of nested canalizing functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Boolean nested canalizing functions (NCFs) have important applications in molecular regulatory networks, engineering and computer science. In this paper, we study their certificate complexity.
Yuan Li, Frank Ingram, Huaming Zhang
doaj +1 more source