Model-equivalent reductions

DOI10.1007/11499107_26MaRDI QIDQ5713724zbMATH OpenOpenAlexFDO

Authors Xishun Zhao, Hans Kleine Büning

Publication date 15 December 2005

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

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

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Equivalence models for quantified Boolean formulas
• NP-logic systems and model-equivalence reductions
• Logspace Reducibility: Models and Equivalences
• On the computational complexity of some classical equivalence relations on boolean functions
• The relative power of logspace and polynomial time reductions

Cited in

(5)

• Equivalence of constrained models
• Eliminating models during model elimination
• scientific article; zbMATH DE number 147105 (Why is no real title available?)
• NP-logic systems and model-equivalence reductions
• Equivalence models for quantified Boolean formulas

Describes a project that uses

Uses Software

• ASSAT

This page was built for publication: Model-equivalent reductions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713724)