On the public citation graph

On counting ac 0 circuits with negative constants

https://doi.org/10.1007/bfb0055790
0 signed · 30 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1999.1675openalex-snapshot
On TC0, AC0, and Arithmetic Circuits
inferredcites →https://doi.org/10.1007/978-1-4612-1872-2_1openalex-snapshot
Time, Hardware, and Uniformity
inferredcites →https://doi.org/10.1007/bf00276023openalex-snapshot
On counting and approximation
inferredcites →https://doi.org/10.1007/bfb0026095openalex-snapshot
On counting and approximation
inferredcites →https://doi.org/10.1007/s000370050023openalex-snapshot
The complexity of matrix rank and feasible systems of linear equations
inferredcites →https://doi.org/10.1016/0020-0190(92)90035-topenalex-snapshot
On iterated integer product
inferredcites →https://doi.org/10.1016/0022-0000(90)90022-dopenalex-snapshot
On uniformity within NC1
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0304-3975(93)90252-oopenalex-snapshot
A very hard log-space counting class
inferredcites →https://doi.org/10.1016/s0022-0000(05)80024-8openalex-snapshot
Gap-definable counting classes
inferredcites →https://doi.org/10.1109/ccc.1997.612309openalex-snapshot
On TC/sup 0/, AC/sup 0/, and arithmetic circuits
inferredcites →https://doi.org/10.1109/sct.1991.160269openalex-snapshot
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits
inferredcites →https://doi.org/10.1137/0215070openalex-snapshot
Log Depth Circuits for Division and Related Problems
inferredcites →https://doi.org/10.1137/0221040openalex-snapshot
Circuit Definitions of Nondeterministic Complexity Classes
inferredcites →https://doi.org/10.1145/237814.237856openalex-snapshot
The complexity of matrix rank and feasible systems of linear equations (extended abstract)
inferredcites →https://doi.org/10.1145/28395.28404openalex-snapshot
Algebraic methods in the theory of lower bounds for Boolean circuit complexity

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jcss.1999.1675openalex-snapshot
On TC0, AC0, and Arithmetic Circuits
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_13openalex-snapshot
Arithmetic Circuits and Polynomial Replacement Systems
inferred← citeshttps://doi.org/10.1007/3-540-46521-9_8openalex-snapshot
Semantical Counting Circuits
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_12openalex-snapshot
Bounded Depth Arithmetic Circuits: Counting and Closure
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_27openalex-snapshot
Arithmetic Constant-Depth Circuit Complexity Classes
inferred← citeshttps://doi.org/10.1016/j.apal.2019.04.006openalex-snapshot
A model-theoretic characterization of constant-depth arithmetic circuits
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.12.017openalex-snapshot
On the complexity of inducing categorical and quantitative association rules
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00025-9openalex-snapshot
Uniform constant-depth threshold circuits for division and iterated multiplication
inferred← citeshttps://doi.org/10.1142/9789812562494_0011openalex-snapshot
THE DIVISION BREAKTHROUGHS
inferred← citeshttps://doi.org/10.1145/288079.288082openalex-snapshot
Technical report column
inferred← citeshttps://doi.org/10.1145/335168.335227openalex-snapshot
Computational properties of metaquerying problems
inferred← citeshttps://doi.org/10.1145/635499.635501openalex-snapshot
Computational properties of metaquerying problems
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2012.66openalex-snapshot
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0106012openalex-snapshot
Computational Properties of Metaquerying Problems
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.