On the public citation graph
Integer Circuit Evaluation Is PSPACE-Complete
0 signed · 32 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-44450-5_13openalex-snapshot
Arithmetic Circuits and Polynomial Replacement Systems
inferredcites →https://doi.org/10.1007/bf01200057openalex-snapshot
Arithmetization: A new method in structural complexity theory
inferredcites →https://doi.org/10.1016/s0022-0000(77)80013-5openalex-snapshot
Sparse complex polynomials and polynomial reducibility
inferredcites →https://doi.org/10.1016/s0304-3975(97)00227-2openalex-snapshot
Non-commutative arithmetic circuits: depth reduction and size lower bounds
inferredcites →https://doi.org/10.1109/psct.1987.10319258openalex-snapshot
PSPACE Survives Three-Bit Bottlenecks
inferredcites →https://doi.org/10.1137/s009753970139207xopenalex-snapshot
Arithmetic Circuits and Polynomial Replacement Systems
inferredcites →https://doi.org/10.1137/s0097539793249530openalex-snapshot
Finite Monoids: From Word to Circuit Evaluation
inferredcites →https://doi.org/10.1145/42267.45069openalex-snapshot
Greatest common divisors of polynomials given by straight-line programs
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11537311_8openalex-snapshot
Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_50openalex-snapshot
The Complexity of Membership Problems for Circuits over Sets of Natural Numbers
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_13openalex-snapshot
Arithmetic Circuits and Polynomial Replacement Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-92935-9_11openalex-snapshot
Arithmetic Circuits with Division
inferred← citeshttps://doi.org/10.1007/978-3-319-40189-8_33openalex-snapshot
Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_23openalex-snapshot
The Complexity of Membership Problems for Circuits over Sets of Integers
inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_12openalex-snapshot
The Complexity of Membership Problems for Circuits over Sets of Positive Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-74510-5_15openalex-snapshot
Equivalence Problems for Circuits over Sets of Natural Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_21openalex-snapshot
Satisfiability of Algebraic Circuits over Sets of Natural Numbers
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_42openalex-snapshot
Functions Definable by Arithmetic Circuits
inferred← citeshttps://doi.org/10.1007/s00224-007-2034-7openalex-snapshot
Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers
inferred← citeshttps://doi.org/10.1007/s00224-008-9144-8openalex-snapshot
Equivalence Problems for Circuits over Sets of Natural Numbers
inferred← citeshttps://doi.org/10.1007/s00224-009-9246-yopenalex-snapshot
Complexity of Equations over Sets of Natural Numbers
inferred← citeshttps://doi.org/10.1016/j.dam.2010.04.001openalex-snapshot
Satisfiability of algebraic circuits over sets of natural numbers
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.08.017openalex-snapshot
The complexity of membership problems for circuits over sets of integers
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.08.025openalex-snapshot
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.09.052openalex-snapshot
Balance problems for integer circuits
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.03.023openalex-snapshot
Emptiness problems for integer circuits
inferred← citeshttps://doi.org/10.1093/logcom/exr050openalex-snapshot
Functions definable by numerical set-expressions
inferred← citeshttps://doi.org/10.1137/s009753970139207xopenalex-snapshot
Arithmetic Circuits and Polynomial Replacement Systems
inferred← citeshttps://doi.org/10.1145/3665339openalex-snapshot
RNA: R1CS Normalization Algorithm Based on Data Flow Graphs for Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2008.1319openalex-snapshot
Complexity of solutions of equations over sets of natural numbers
inferred← citeshttps://doi.org/10.48550/arxiv.1504.04181openalex-snapshot
Constraint Satisfaction Problems around Skolem Arithmetic
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.