scientific article; zbMATH DE number 1390276
From MaRDI portal
Publication:4934563
zbMath0939.03065MaRDI QIDQ4934563
Publication date: 17 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boolean functionsinteger linear programmingcircuit complexitynonclassical logicspropositional proof systemlengths of proofscomplexity of propositional proofscomplexity of sorting networkseffective interpolation
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20)
Related Items (24)
Monotone simulations of non-monotone proofs. ⋮ Narrow Proofs May Be Maximally Long ⋮ On the automatizability of resolution and related propositional proof systems ⋮ Expander Construction in VNC1 ⋮ A lower bound for intuitionistic logic ⋮ Characterizing Propositional Proofs as Noncommutative Formulas ⋮ A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games ⋮ Classes of representable disjoint \textsf{NP}-pairs ⋮ Expander construction in \(\mathrm{VNC}^1\) ⋮ The power of the binary value principle ⋮ On reducibility and symmetry of disjoint NP pairs. ⋮ Complexity of optimizing over the integers ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization ⋮ Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems ⋮ Algebraic proofs over noncommutative formulas ⋮ Proof Complexity Meets Algebra ⋮ Rank bounds for a hierarchy of Lovász and Schrijver ⋮ Propositional proof systems based on maximum satisfiability ⋮ On the complexity of cutting-plane proofs using split cuts ⋮ On the computational content of intuitionistic propositional proofs ⋮ Several notes on the power of Gomory-Chvátal cuts ⋮ Mean-payoff games and propositional proofs ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II ⋮ Two party immediate response disputes: Properties and efficiency
This page was built for publication:
