Results 51 to 60 of about 236,217 (313)
On the proof complexity of deep inference [PDF]
ACM Transactions on Computational Logic, 2009 We obtain two results about the proof complexity of deep inference: (1) Deep-inference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin extension rule or with the substitution rule; (2) there are analytic deep-inference proof systems that exhibit an exponential speedup over analytic Gentzen proof systems that ...
Bruscoli, Paola, Guglielmi, Alessio
openaire +2 more sources
Symmetry properties of the Novelli-Pak-Stoyanovskii algorithm [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 The number of standard Young tableaux of a fixed shape is famously given by the hook-length formula due to Frame, Robinson and Thrall. A bijective proof of Novelli, Pak and Stoyanovskii relies on a sorting algorithm akin to jeu-de-taquin which transforms
Robin Sulzgruber
doaj +1 more source
Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time
IACR Cryptology ePrint Archive, 2021 We propose a new doubly efficient interactive proof protocol for general arithmetic circuits. The protocol generalizes the interactive proof for layered circuits proposed by Goldwasser, Kalai and Rothblum to arbitrary circuits, while preserving the ...
Jiaheng Zhang +3 more
semanticscholar +1 more source
Finding Small Proofs for Description Logic Entailments: Theory and Practice (Extended Technical Report) [PDF]
Logic Programming and Automated Reasoning, 2020 Logic-based approaches to AI have the advantage that their behaviour can in principle be explained by providing their users with proofs for the derived consequences.
Christian Alrabbaa +4 more
semanticscholar +1 more source
3-manifolds efficiently bound 4-manifolds
, 2007 It is known since 1954 that every 3-manifold bounds a 4-manifold. Thus, for instance, every 3-manifold has a surgery diagram. There are several proofs of this fact, including constructive proofs, but there has been little attention to the complexity of ...
Brock +27 more
core +1 more source
Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I [PDF]
Yugoslav Journal of Operations Research, 2014 This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions.
Eremeev Anton V., Kovalenko Julia V.
doaj +1 more source
Settling the Complexity of Computing Approximate Two-Player Nash Equilibria [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2016 We prove that there exists a constant ε > 0 such that, assuming the Exponential Time Hypothesis for PPAD, computing an ε-approximate Nash equilibrium in a two-player (n × n) game requires quasi-polynomial time, nlog1-o(1) n.
A. Rubinstein
semanticscholar +1 more source
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda [PDF]
Logical Methods in Computer Science, 2016 Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose.
Jean-Philippe Bernardy, Patrik Jansson
doaj +1 more source
The computational complexity of PEPS [PDF]
, 2006 We determine the computational power of preparing Projected Entangled Pair States (PEPS), as well as the complexity of classically simulating them, and generally the complexity of contracting tensor networks.
A. Y. Kitaev +9 more
core +3 more sources
Complexity of Propositional Proofs under a Promise [PDF]
, 2007 We study -- within the framework of propositional proof complexity -- the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiable formula has many satisfying assignments, where ``many'' stands for an explicitly ...
Dershowitz, Nachum, Tzameret, Iddo
core +3 more sources