Two systems for proving tautologies, based on the split method

DOI10.1007/BF01084392zbMath0509.03004MaRDI QIDQ1838470

Evgeny Dantsin

Publication date: 1983

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

propositional tautologiesclasses with polynomial time recognition algorithm

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Classical propositional logic (03B05) Complexity of proofs (03F20)

Related Items

An improved upper bound for SAT ⋮ New methods for 3-SAT decision and worst-case analysis ⋮ Separating signs in the propositional satisfiability problem ⋮ The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs

Cites Work

• Unnamed Item
• Unnamed Item