scientific article; zbMATH DE number 1765669
From MaRDI portal
Publication:4539605
zbMath0988.03020MaRDI QIDQ4539605
Publication date: 10 July 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2083/20830168
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints ⋮ Analyzing read-once cutting plane proofs in Horn systems ⋮ Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets ⋮ Homomorphisms of conjunctive normal forms. ⋮ The NP-hardness of finding a directed acyclic graph for regular resolution ⋮ On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas ⋮ Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints ⋮ Finding read-once resolution refutations in systems of 2CNF clauses ⋮ On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems ⋮ NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability ⋮ Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas ⋮ Pool resolution is NP-hard to recognize ⋮ On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations
This page was built for publication:
