On the public citation graph

Characterizing Valiant’s Algebraic Complexity Classes

https://doi.org/10.1007/11821069_61
0 signed · 46 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/inco.1995.1007openalex-snapshot
The Complexity of Iterated Multiplication
inferredcites →https://doi.org/10.1007/3-540-44450-5_13openalex-snapshot
Arithmetic Circuits and Polynomial Replacement Systems
inferredcites →https://doi.org/10.1007/3-540-44679-6_1openalex-snapshot
Complete Problems for Valiant’s Class of qp-Computable Families of Polynomials
inferredcites →https://doi.org/10.1007/978-3-662-04179-6openalex-snapshot
Completeness and Reduction in Algebraic Complexity Theory
inferredcites →https://doi.org/10.1007/bf01200057openalex-snapshot
Arithmetization: A new method in structural complexity theory
inferredcites →https://doi.org/10.1007/s00037-000-0170-4openalex-snapshot
The complexity of tensor calculus
inferredcites →https://doi.org/10.1007/s00037-004-0182-6openalex-snapshot
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
inferredcites →https://doi.org/10.1007/s00037-004-0186-2openalex-snapshot
Valiant?s model and the cost of computing integers
inferredcites →https://doi.org/10.1016/0020-0190(84)90018-8openalex-snapshot
On computing the determinant in small parallel time using a small number of processors
inferredcites →https://doi.org/10.1016/0022-0000(91)90020-6openalex-snapshot
Properties that characterize LOGCFL
inferredcites →https://doi.org/10.1016/s0024-3795(02)00330-0openalex-snapshot
Computation of sparse circulant permanents via determinants
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.1016/s0747-7171(87)80063-9openalex-snapshot
Feasible arithmetic computations: Valiant's hypothesis
inferredcites →https://doi.org/10.1017/cbo9780511526633.008openalex-snapshot
Why is Boolean Complexity Theory so Difficult?
inferredcites →https://doi.org/10.1137/0212043openalex-snapshot
Fast Parallel Computation of Polynomials Using Few Processors
inferredcites →https://doi.org/10.1137/0218036openalex-snapshot
A New Pebble Game that Characterizes Parallel Complexity Classes
inferredcites →https://doi.org/10.1137/0221040openalex-snapshot
Circuit Definitions of Nondeterministic Complexity Classes
inferredcites →https://doi.org/10.1145/12130.12163openalex-snapshot
Uniform closure properties of P-computable functions
inferredcites →https://doi.org/10.1145/322326.322341openalex-snapshot
Some Exact Complexity Results for Straight-Line Computations over Semirings
inferredcites →https://doi.org/10.1145/3749740.3749750openalex-snapshot
Completeness Classes in Algebra
inferredcites →https://doi.org/10.1145/780542.780595openalex-snapshot
Derandomizing polynomial identity tests means proving circuit lower bounds
inferredcites →https://doi.org/10.1155/s1073792804142566openalex-snapshot
inferredcites →https://doi.org/10.4230/dagsemproc.06111.12openalex-snapshot
On the Complexity of Numerical Analysis

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_8openalex-snapshot
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_37openalex-snapshot
On the Closures of Monotone Algebraic Classes and Variants of the Determinant
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_33openalex-snapshot
VPSPACE and a Transfer Theorem over the Complex Field
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_13openalex-snapshot
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_20openalex-snapshot
On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_33openalex-snapshot
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_37openalex-snapshot
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_23openalex-snapshot
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_18openalex-snapshot
Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_23openalex-snapshot
Small-Space Analogues of Valiant’s Classes
inferred← citeshttps://doi.org/10.1007/s00224-009-9241-3openalex-snapshot
On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth
inferred← citeshttps://doi.org/10.1016/j.dam.2010.09.007openalex-snapshot
On the expressive power of CNF formulas of bounded tree- and clique-width
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.08.008openalex-snapshot
The complexity of two problems on arithmetic circuits
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.08.026openalex-snapshot
VPSPACE and a transfer theorem over the complex field
inferred← citeshttps://doi.org/10.1090/jams/864openalex-snapshot
Geometric complexity theory V: Efficient algorithms for Noether normalization
inferred← citeshttps://doi.org/10.1090/jams/908openalex-snapshot
No Occurrence Obstructions in Geometric Complexity Theory
inferred← citeshttps://doi.org/10.1090/proc/13310openalex-snapshot
Permanent versus determinant: Not via saturations
inferred← citeshttps://doi.org/10.1109/ccc.2007.33openalex-snapshot
The Complexity of Polynomials and Their Coefficient Functions
inferred← citeshttps://doi.org/10.1109/focs.2012.15openalex-snapshot
Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma
inferred← citeshttps://doi.org/10.1145/3470858openalex-snapshot
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes
inferred← citeshttps://doi.org/10.2178/jsl/1230396913openalex-snapshot
A la recherche de la definition de la complexite d'espace pour le calcul des polynomes a la maniere de Valiant
inferred← citeshttps://doi.org/10.48550/arxiv.0705.3751openalex-snapshot
On the expressive power of planar perfect matching and permanents of bounded treewidth matrices
inferred← citeshttps://doi.org/10.48550/arxiv.0801.3408openalex-snapshot
On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth
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.