Satisfiability of Algebraic Circuits over Sets of Natural Numbers
From MaRDI portal
Publication:5458839
DOI10.1007/978-3-540-77050-3_21zbMath1135.68440OpenAlexW2240617993MaRDI QIDQ5458839
Christian Glaßer, Matthias Waldherr, Christian Reitwießner, Stephen Travers
Publication date: 24 April 2008
Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_21
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (1)
Cites Work
This page was built for publication: Satisfiability of Algebraic Circuits over Sets of Natural Numbers