On the public citation graph

Characterizing Arithmetic Read-Once Formulae

0 signed · 27 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.1995.1042openalex-snapshot
Learning Boolean Read-Once Formulas over Generalized Bases
inferredcites →https://doi.org/10.1006/jcss.1997.1550openalex-snapshot
On Interpolating Arithmetic Read-Once Formulas with Exponentiation
inferredcites →https://doi.org/10.1007/3-540-09519-5_73openalex-snapshot
Probabilistic algorithms for sparse polynomials
inferredcites →https://doi.org/10.1007/978-3-642-14165-2_35openalex-snapshot
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
inferredcites →https://doi.org/10.1007/s00037-015-0105-8openalex-snapshot
Read-once polynomial identity testing
inferredcites →https://doi.org/10.1007/s00493-003-0025-0openalex-snapshot
Improved Low-Degree Testing and its Applications
inferredcites →https://doi.org/10.1016/0012-365x(93)90372-zopenalex-snapshot
Combinatorial characterization of read-once formulae
inferredcites →https://doi.org/10.1109/ccc.2011.18openalex-snapshot
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae
inferredcites →https://doi.org/10.1109/sfcs.1991.185341openalex-snapshot
Approximating clique is almost NP-complete
inferredcites →https://doi.org/10.1137/s009753979223664xopenalex-snapshot
Learning Arithmetic Read-Once Formulas
inferredcites →https://doi.org/10.1137/s009753979528812xopenalex-snapshot
Interpolating Arithmetic Read-Once Formulas in Parallel
inferredcites →https://doi.org/10.1145/138027.138061openalex-snapshot
Learning read-once formulas with queries
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/380752.380801openalex-snapshot
Randomness efficient identity testing of multivariate polynomials
inferredcites →https://doi.org/10.1561/0400000039openalex-snapshot
Arithmetic Circuits: A Survey of Recent Results and Open Questions
inferredcites →https://doi.org/10.4086/toc.2014.v010a018openalex-snapshot

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-79416-3_9openalex-snapshot
Limitations of Sums of Bounded Read Formulas and ABPs
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_19openalex-snapshot
Sums of Read-Once Formulas: How Many Summands Suffice?
inferred← citeshttps://doi.org/10.1007/s00453-015-0101-zopenalex-snapshot
Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.10.019openalex-snapshot
Sums of read-once formulas: How many summands are necessary?
inferred← citeshttps://doi.org/10.1134/s1995080221110226openalex-snapshot
On Read-Once Functions over $$\boldsymbol{\mathbb{Z}}_{\mathbf{3}}$$
inferred← citeshttps://doi.org/10.1142/s1793042126500697openalex-snapshot
Integer complexity: Stability and self-similarity
inferred← citeshttps://doi.org/10.1145/3196836openalex-snapshot
Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas
inferred← citeshttps://doi.org/10.1145/3313232openalex-snapshot
Lower bounds for Sum and Sum of Products of Read-once Formulas
inferred← citeshttps://doi.org/10.2140/moscow.2019.8.193openalex-snapshot
Integer complexity: the integer defect
inferred← citeshttps://doi.org/10.48550/arxiv.1606.03635openalex-snapshot
Integer complexity: algorithms and computational results
inferred← citeshttps://doi.org/10.48550/arxiv.2010.01385openalex-snapshot
Limitations of Sums of Bounded-Read Formulas
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.