Arithmetic circuits with division

DOI10.1007/978-3-031-92935-9_11MaRDI QIDQ6902114zbMATH OpenFDO

Authors Silas Cato Sacher

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92935-9_11

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Circuit satisfiability and constraint satisfaction around Skolem arithmetic
• Emptiness problems for integer circuits
• Equivalence problems for circuits over sets of natural numbers
• Functions definable by arithmetic circuits
• scientific article; zbMATH DE number 3874608 (Why is no real title available?)
• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• scientific article; zbMATH DE number 3967918 (Why is no real title available?)
• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 2077109 (Why is no real title available?)
• Integer circuit evaluation is PSPACE-complete
• Reducibility among combinatorial problems
• Satisfiability of algebraic circuits over sets of natural numbers
• The complexity of iterated multiplication
• The complexity of membership problems for circuits over sets of integers
• The complexity of membership problems for circuits over sets of natural numbers
• The Complexity of Membership Problems for Circuits over Sets of Positive Numbers

This page was built for publication: Arithmetic circuits with division

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