Equivalence Problems for Circuits over Sets of Natural Numbers

DOI10.1007/978-3-540-74510-5_15zbMath1188.68157OpenAlexW1699174621MaRDI QIDQ3499771

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

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

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

Related Items (4)

Complexity of equations over sets of natural numbers ⋮ Functions Definable by Arithmetic Circuits ⋮ Satisfiability of algebraic circuits 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