On the public citation graph
Sets computable in polynomial time on average
0 signed · 25 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-55808-x_38openalex-snapshot
Almost every set in exponential time is P-bi-immune
inferredcites →https://doi.org/10.1007/3-540-56287-7_100openalex-snapshot
Structural average case complexity
inferredcites →https://doi.org/10.1007/bf01699457openalex-snapshot
Bi-immune sets for complexity classes
inferredcites →https://doi.org/10.1016/0022-0000(91)90007-ropenalex-snapshot
Average case completeness
inferredcites →https://doi.org/10.1016/0022-0000(92)90019-fopenalex-snapshot
On the theory of average case complexity
inferredcites →https://doi.org/10.1016/s0019-9958(86)80024-9openalex-snapshot
The density and complexity of polynomial cores for intractable sets
inferredcites →https://doi.org/10.1016/s0304-3975(82)80003-0openalex-snapshot
Computational complexity of real functions
inferredcites →https://doi.org/10.1109/fscs.1990.89604openalex-snapshot
No better ways to generate hard NP instances than picking uniformly at random
inferredcites →https://doi.org/10.1109/sct.1993.336540openalex-snapshot
Isomorphisms of NP complete problems on random instances
inferredcites →https://doi.org/10.1137/0210008openalex-snapshot
Relative to a Random Oracle A , ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
inferredcites →https://doi.org/10.1137/0210061openalex-snapshot
Completeness, Approximation and Density
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_36openalex-snapshot
Average-Case Non-approximability of Optimisation Problems
inferred← citeshttps://doi.org/10.1007/3-540-44849-7_26openalex-snapshot
Nearly Bounded Error Probabilistic Sets
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_18openalex-snapshot
Distributionally-Hard Languages
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_52openalex-snapshot
Average polynomial time is hard for exponential time under sn-reductions
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_28openalex-snapshot
Fine separation of average time complexity classes
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_12openalex-snapshot
Average-Case Computational Complexity Theory
inferred← citeshttps://doi.org/10.1007/bfb0015409openalex-snapshot
Structure in average case complexity
inferred← citeshttps://doi.org/10.1007/bfb0055799openalex-snapshot
Average-case intractability vs. worst-case intractability
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00295-9openalex-snapshot
Complete distributional problems, hard languages, and resource-bounded measure
inferred← citeshttps://doi.org/10.1109/ccc.1996.507681openalex-snapshot
Truth-table closure and Turing closure of average polynomial time have different measures in EXP
inferred← citeshttps://doi.org/10.1137/s0097539796311715openalex-snapshot
Fine Separation of Average-Time Complexity Classes
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.