scientific article; zbMATH DE number 3420722

zbMath0267.02023MaRDI QIDQ5685059

G. S. Tseĭtin, Boris A. Kushner

Publication date: 1968

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Proof theory and constructive mathematics (03F99)

Related Items

Resolution lower bounds for perfect matching principles ⋮ Computational complexity of functions ⋮ An answer to an open problem of Urquhart ⋮ Resolution lower bounds for the weak functional pigeonhole principle. ⋮ What is answer set programming to propositional satisfiability ⋮ Compact normal forms in propositional logic and integer programming formulations ⋮ An optimality result for clause form translation ⋮ Extended resolution simulates binary decision diagrams ⋮ The complexity of the Hajós calculus for planar graphs ⋮ The complexity of Gentzen systems for propositional logic ⋮ Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space ⋮ The splitting of variables and constraints in the formulation of integer programming models ⋮ Relative efficiency of propositional proof systems: Resolution vs. cut-free LK

This page was built for publication: