scientific article; zbMATH DE number 1361489
From MaRDI portal
Publication:4699307
zbMath0935.03067MaRDI QIDQ4699307
Publication date: 1 February 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20)
Related Items (12)
On finding short resolution refutations and small unsatisfiable subsets ⋮ Transformation rules for CNOT-based quantum circuits and their applications ⋮ Density condensation of Boolean formulas ⋮ A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints ⋮ The NP-hardness of finding a directed acyclic graph for regular resolution ⋮ 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 ⋮ NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability ⋮ Finding a tree structure in a resolution proof is NP-complete ⋮ Computational aspects of infeasibility analysis in mixed integer programming ⋮ Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas ⋮ Pool resolution is NP-hard to recognize
This page was built for publication:
