Mathematical Foundations of Computer Science 2003

DOI10.1007/b11836zbMath1124.68375OpenAlexW2495578842MaRDI QIDQ5431351

Steffen Reith

Publication date: 7 December 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11836

zbMATH Keywords

computational complexityBoolean functionsclosed classessatisfiability problemsBoolean isomorphismPostDichotomyBoolean equivalence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05) Boolean functions (06E30)

Related Items (7)

On the applicability of Post's lattice ⋮ Complexity of DNF minimization and isomorphism testing for monotone formulas ⋮ How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms ⋮ The complexity of circumscriptive inference in Post's lattice ⋮ The Weight in Enumeration ⋮ The complexity of propositional implication ⋮ Computational complexity for bounded distributive lattices with negation

This page was built for publication: Mathematical Foundations of Computer Science 2003