Restrictive acceptance suffices for equivalence problems

DOI10.1007/3-540-48321-7_9MaRDI QIDQ4934323zbMATH OpenFDO

Authors Lane A. Hemaspaandra, Jörg Rothe, Bernd Borchert

Publication date 26 April 2000

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

Full work available at URL https://doi.org/10.1007/3-540-48321-7_9

zbMATH Keywords

ordered binary decision diagrams

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Restrictive Acceptance Suffices for Equivalence Problems
• scientific article; zbMATH DE number 67819
• Equivalence constraint satisfaction problems
• On the restricted equivalence for subclasses of propositional logic
• Equivalence issues in abduction and induction
• Equivalence relations and determinacy
• scientific article; zbMATH DE number 978456
• A complete axiomatization of strict equality
• Triviality for restrictor conditionals
• Restricted equivalence functions

Cited in

(2)

• A second step towards complexity-theoretic analogs of Rice's Theorem
• Restrictive Acceptance Suffices for Equivalence Problems

This page was built for publication: Restrictive acceptance suffices for equivalence problems

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