scientific article; zbMATH DE number 1390276
From MaRDI portal
Publication:4934563
Recommendations
Cited in
(67)- On lengths of proofs in non-classical logics
- Tautologies with a unique Craig interpolant, uniform vs. nonuniform complexity
- The complexity of Gentzen systems for propositional logic
- The expected complexity of analytic tableaux analyses in propositional calculus. II
- On reducibility and symmetry of disjoint NP pairs.
- A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games
- Monotone simulations of non-monotone proofs.
- On the automatizability of resolution and related propositional proof systems
- Some remarks on lengths of propositional proofs
- Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Expander construction in \(\mathrm{VNC}^1\)
- Propositional proof systems based on maximum satisfiability
- The universe of propositional approximations
- Several notes on the power of Gomory-Chvátal cuts
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization
- On extracting computations from propositional proofs (a survey)
- The properties of determinative disjunctive normal forms and systems based on them
- Proof theory
- scientific article; zbMATH DE number 3849198 (Why is no real title available?)
- On hardly linearly provable systems
- Complexity of propositional proofs (invited talk)
- Propositional Logic for Circuit Classes
- scientific article; zbMATH DE number 3922641 (Why is no real title available?)
- scientific article; zbMATH DE number 3954886 (Why is no real title available?)
- scientific article; zbMATH DE number 3954903 (Why is no real title available?)
- scientific article; zbMATH DE number 1222561 (Why is no real title available?)
- Discretely ordered modules as a first-order extension of the cutting planes proof system
- On the complexity of propositional quantification in intuitionistic logic
- scientific article; zbMATH DE number 1179974 (Why is no real title available?)
- scientific article; zbMATH DE number 2044514 (Why is no real title available?)
- scientific article; zbMATH DE number 2079024 (Why is no real title available?)
- Characterizing propositional proofs as noncommutative formulas
- Proof Complexity Meets Algebra
- A finite-model-theoretic view on propositional proof complexity
- Expander construction in \(\mathsf{VNC}^1\)
- scientific article; zbMATH DE number 6963530 (Why is no real title available?)
- scientific article; zbMATH DE number 4114609 (Why is no real title available?)
- On the complexity of computation of rudimentary predicates
- Rank bounds for a hierarchy of Lovász and Schrijver
- Proof compression and NP versus PSPACE. II
- Narrow proofs may be maximally long
- On the computational complexity of finding hard tautologies
- scientific article; zbMATH DE number 5263419 (Why is no real title available?)
- scientific article; zbMATH DE number 3313427 (Why is no real title available?)
- Uniform Proof Complexity
- A note on the complexity of propositional Hoare logic
- Logical Approaches to Computational Barriers
- On the computational content of intuitionistic propositional proofs
- Complexity of deductions in a system of classical propositional calculus
- The power of the binary value principle
- Complexity of optimizing over the integers
- Algebraic proofs over noncommutative formulas
- Semialgebraic proofs, IPS lower bounds, and the -conjecture: can a natural number be negative?
- First-order reasoning and efficient semi-algebraic proofs
- Complexity of subclasses of the intuitionistic propositional calculus
- TFNP intersections through the Lens of feasible disjunction
- The power of the binary value principle
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- A simplified lower bound for implicational logic
- Mean-payoff games and propositional proofs
- Two party immediate response disputes: Properties and efficiency
- A lower bound for intuitionistic logic
- Classes of representable disjoint \textsf{NP}-pairs
- On meta complexity of propositional formulas and propositional proofs
- On the complexity of cutting-plane proofs using split cuts
- Counting complexity of propositional abduction
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 Q4934563)
