Equivalence Problems for Circuits over Sets of Natural Numbers

DOI10.1007/978-3-540-74510-5_15MaRDI QIDQ3499771zbMATH OpenOpenAlexFDO

Authors Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen Travers, Matthias Waldherr

Publication date 3 June 2008

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74510-5_15

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Equivalence problems for circuits over sets of natural numbers
• The complexity of membership problems for circuits over sets of natural numbers
• scientific article; zbMATH DE number 1962845
• Mathematical Foundations of Computer Science 2004
• The complexity of membership problems for circuits over sets of integers

Cited in

(7)

• Computational completeness of equations over sets of natural numbers
• Equivalence problems for circuits over sets of natural numbers
• Functions definable by arithmetic circuits
• The Complexity of Membership Problems for Circuits over Sets of Positive Numbers
• Satisfiability of Algebraic Circuits over Sets of Natural Numbers
• Complexity of equations over sets of natural numbers
• Satisfiability of algebraic circuits over sets of natural numbers

This page was built for publication: Equivalence Problems for Circuits over Sets of Natural Numbers

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