scientific article; zbMATH DE number 1179974
From MaRDI portal
Publication:4399249
Recommendations
Cited in
(45)- A syntactical proof of the Marriage Lemma.
- Characterizing propositional proofs as noncommutative formulas
- Proving the infeasibility of Horn formulas through read-once resolution
- Reflections on Proof Complexity and Counting Principles
- scientific article; zbMATH DE number 1860652 (Why is no real title available?)
- Towards NP-P via proof complexity and search
- The complexity of the Hajós calculus for planar graphs
- Short Proofs for the Determinant Identities
- The Complexity of Propositional Proofs
- Combinatorics of first order structures and propositional proof systems
- Proof compressions with circuit-structured substitutions
- Proof theory
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
- Copy complexity of Horn formulas with respect to unit read-once resolution
- Mean-payoff games and propositional proofs
- Finding read-once resolution refutations in systems of 2CNF clauses
- Resolution lower bounds for the weak functional pigeonhole principle.
- Optimal length resolution refutations of difference constraint systems
- Propositional proof systems and fast consistency provers
- Different approaches to proof systems
- A finite-model-theoretic view on propositional proof complexity
- Complexity of propositional proofs (invited talk)
- Resolution lower bounds for perfect matching principles
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- Rigorous results for random (\(2+p)\)-SAT
- Unrestricted vs restricted cut in a tableau method for Boolean circuits
- A unified framework for DPLL(T) + certificates
- Upper bounds on complexity of Frege proofs with limited use of certain schemata
- Computational properties of argument systems satisfying graph-theoretic constraints
- Propositional proof complexity
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability
- Theorem Proving in Higher Order Logics
- scientific article; zbMATH DE number 1342249 (Why is no real title available?)
- scientific article; zbMATH DE number 1390276 (Why is no real title available?)
- Proof compression and NP versus PSPACE. II
- On the computational complexity of read once resolution decidability in 2CNF formulas
- The complexity of finding read-once NAE-resolution refutations
- Propositional proof systems, the consistency of first order theories and the complexity of computations
- Two party immediate response disputes: Properties and efficiency
- Towards NP-P via proof complexity and search
- Narrow proofs may be maximally long
- scientific article; zbMATH DE number 7471587 (Why is no real title available?)
- A surprising relationship between descriptive complexity and proof complexity
- Logical Approaches to Computational Barriers
- Proof Compression and NP Versus PSPACE II: Addendum
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4399249)
