Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMATH Open1156.68397OpenAlexW2494705596MaRDI QIDQ5492852FDOQ5492852

Authors: Michael Bauland, Edith Hemaspaandra 

Publication date: 20 October 2006

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

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

Recommendations

• Isomorphic implication
• STACS 2004
• scientific article; zbMATH DE number 1948177
• The Formula Isomorphism Problem
• The complexity of propositional implication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (4)

• STACS 2004
• Isomorphic implication
• Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
• Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?

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

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