Integer circuit evaluation is PSPACE-complete
From MaRDI portal
Recommendations
Cites work
- Arithmetization: A new method in structural complexity theory
- Finite Monoids: From Word to Circuit Evaluation
- scientific article; zbMATH DE number 3830444 (Why is no real title available?)
- scientific article; zbMATH DE number 3874609 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 2080200 (Why is no real title available?)
- scientific article; zbMATH DE number 3221503 (Why is no real title available?)
- Non-commutative arithmetic circuits: depth reduction and size lower bounds
Cited in
(9)- Circuit satisfiability and constraint satisfaction around Skolem arithmetic
- Emptiness problems for integer circuits
- Balance problems for integer circuits
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic
- Balance problems for integer circuits
- Emptiness problems for integer circuits
- Complexity of equations over sets of natural numbers
- Arithmetic circuits with division
- RNA: R1CS normalization algorithm based on data flow graphs for zero-knowledge proofs
This page was built for publication: Integer circuit evaluation is PSPACE-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956016)