On the public citation graph
A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees
0 signed · 43 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-06841-4_81openalex-snapshot
On Sets Having Only Hard Subsets
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-16486-3_99openalex-snapshot
What is a hard instance of a computational problem?
inferredcites →https://doi.org/10.1007/bf01699457openalex-snapshot
Bi-immune sets for complexity classes
inferredcites →https://doi.org/10.1007/bf01768464openalex-snapshot
Inclusion complete tally languages and the Hartmanis-Berman conjecture
inferredcites →https://doi.org/10.1007/bfb0030328openalex-snapshot
The structure of polynomial complexity cores
inferredcites →https://doi.org/10.1016/0304-3975(83)90015-4openalex-snapshot
A Turing machine time hierarchy
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50006-3openalex-snapshot
COMPUTATIONALLY COMPLEX AND PSEUDO-RANDOM ZERO-ONE VALUED FUNCTIONS††Portions of this work were carried out at Carngie-Mellon University, while the authors were in the Department of Computer Science. Portions of these results were reported in preliminary form in [1].
inferredcites →https://doi.org/10.1016/s0019-9958(82)90515-0openalex-snapshot
A note on deterministic and nondeterministic time complexity
inferredcites →https://doi.org/10.1109/sfcs.1976.22openalex-snapshot
On the structure of complete sets: Almost everywhere complexity and infinitely often speedup
inferredcites →https://doi.org/10.1145/2455.214111openalex-snapshot
Hard-core theorems for complexity classes
inferredcites →https://doi.org/10.1145/321832.321840openalex-snapshot
On Almost Everywhere Complex Recursive Functions
inferredcites →https://doi.org/10.1145/321864.321877openalex-snapshot
On the Structure of Polynomial Time Reducibility
inferredcites →https://doi.org/10.1145/321892.321895openalex-snapshot
On Reducibility to Complex or Sparse Sets
inferredcites →https://doi.org/10.1145/321958.321975openalex-snapshot
P-Complete Approximation Problems
inferredcites →https://doi.org/10.1145/322047.322061openalex-snapshot
Separating Nondeterministic Time Complexity Classes
inferredcites →https://doi.org/10.1145/800070.802172openalex-snapshot
The tight deterministic time hierarchy
inferredcites →https://doi.org/10.1145/800141.804678openalex-snapshot
Some connections between nonuniform and uniform complexity classes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2001.3110openalex-snapshot
Almost-Everywhere Superiority for Quantum Polynomial Time
inferred← citeshttps://doi.org/10.1007/3-540-51734-0_55openalex-snapshot
Learning programs with an easy to calculate set of errors
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_27openalex-snapshot
A note on the almost-everywhere hierarchy for nondeterministic time
inferred← citeshttps://doi.org/10.1007/3-540-53504-7_60openalex-snapshot
Almost-everywhere complexity, bi-immunity and nondeterministic space
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-3-642-14165-2_43openalex-snapshot
Weak Completeness Notions for Exponential Time
inferred← citeshttps://doi.org/10.1007/bfb0086124openalex-snapshot
On the relationship between the complexity, the degree, and the extension of a computable set
inferred← citeshttps://doi.org/10.1007/pl00009267openalex-snapshot
Reductions Do Not Preserve Fast Convergence Rates in Average Time
inferred← citeshttps://doi.org/10.1007/s00224-019-09920-4openalex-snapshot
Weak Completeness Notions for Exponential Time
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90021-4openalex-snapshot
Some consequences of the existence of pseudorandom generators
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90006-iopenalex-snapshot
A complexity theory for feasible closure properties
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90177-jopenalex-snapshot
Bi-immunity results for cheatable sets
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90117-copenalex-snapshot
Almost-everywhere complexity hierarchies for nondeterministic time
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90022-topenalex-snapshot
A note on almost-everywhere-complex sets and separating deterministic-time-complexity classes
inferred← citeshttps://doi.org/10.1109/sct.1989.41830openalex-snapshot
The complexity types of computable sets
inferred← citeshttps://doi.org/10.1109/sct.1991.160240openalex-snapshot
A complexity theory for feasible closure properties
inferred← citeshttps://doi.org/10.1137/s0097539796311715openalex-snapshot
Fine Separation of Average-Time Complexity Classes
inferred← citeshttps://doi.org/10.1145/28395.28412openalex-snapshot
Some consequences of the existence of pseudorandom generators
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/9910033openalex-snapshot
Almost-Everywhere Superiority for Quantum Computing
inferred← citeshttps://doi.org/10.5555/93025.93092openalex-snapshot
Learning programs with an easy to calculate set of errors
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.