On the public citation graph
SeparatingPH fromPP by relativization
0 signed · 22 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/bf00289117openalex-snapshot
The complexity of combinatorial problems with succinct input representation
inferredcites →https://doi.org/10.1007/bfb0009651openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1007/bfb0036487openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1109/sct.1989.41826openalex-snapshot
Turning machines with few accepting computations and low sets for PP
inferredcites →https://doi.org/10.1109/sct.1989.41828openalex-snapshot
On the power of probabilistic polynomial time: P/sup NP(log)/ contained in PP
inferredcites →https://doi.org/10.1109/sfcs.1989.63527openalex-snapshot
On the computational power of PP and (+)P
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.1997.1552openalex-snapshot
A Lower Bound for Perceptrons and an Oracle Separation of the PPPHHierarchy
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_80openalex-snapshot
Algebrization and Randomization Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_26openalex-snapshot
Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-642-22616-8_1openalex-snapshot
The Complexity of Testing Monomials in Multivariate Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-642-22616-8_2openalex-snapshot
Algorithms for Testing Monomials in Multivariate Polynomials
inferred← citeshttps://doi.org/10.1007/bf01263422openalex-snapshot
Perceptrons, PP, and the polynomial hierarchy
inferred← citeshttps://doi.org/10.1007/s10878-012-9496-5openalex-snapshot
Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.07.007openalex-snapshot
Learning DNF in time 2Õ(n1/3)
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.06.021openalex-snapshot
Extremal properties of polynomial threshold functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.038openalex-snapshot
On testing monomials in multivariate polynomials
inferred← citeshttps://doi.org/10.1109/ccc.1997.612312openalex-snapshot
A lower bound for perceptrons and an oracle separation of the PP/sup PH/ hierarchy
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214406openalex-snapshot
Extremal properties of polynomial threshold functions
inferred← citeshttps://doi.org/10.1109/sct.1993.336538openalex-snapshot
The polynomial method in circuit complexity
inferred← citeshttps://doi.org/10.1142/s1793830914500165openalex-snapshot
TOWARD RANDOMIZED TESTING OF q-MONOMIALS IN MULTIVARIATE POLYNOMIALS
inferred← citeshttps://doi.org/10.48550/arxiv.1302.5898openalex-snapshot
Towards Randomized Testing of $q$-Monomials in Multivariate Polynomials
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.