On the public citation graph

RelativizedNC

https://doi.org/10.1007/bf01692056
0 signed · 51 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.1007/3-540-16486-3_85openalex-snapshot
The complexity of sparse sets in P
inferredcites →https://doi.org/10.1007/bf00265223openalex-snapshot
The network complexity and the Turing machine complexity of finite functions
inferredcites →https://doi.org/10.1007/bf01683260openalex-snapshot
Relativization of questions about log space computability
inferredcites →https://doi.org/10.1007/bf01744301openalex-snapshot
On relativizing auxiliary pushdown machines
inferredcites →https://doi.org/10.1016/0022-0000(81)90038-6openalex-snapshot
On uniform circuit complexity
inferredcites →https://doi.org/10.1016/0022-0000(84)90066-7openalex-snapshot
Space-bounded hierarchies and probabilistic computations
inferredcites →https://doi.org/10.1016/0022-0000(85)90040-6openalex-snapshot
Relativized circuit complexity
inferredcites →https://doi.org/10.1016/0022-0000(85)90053-4openalex-snapshot
Qualitative relativizations of complexity classes
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(83)90029-4openalex-snapshot
A Boolean function requiring 3n network size
inferredcites →https://doi.org/10.1016/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1109/sfcs.1983.39openalex-snapshot
On determinism versus non-determinism and related problems
inferredcites →https://doi.org/10.1109/sfcs.1984.715894openalex-snapshot
Log Depth Circuits For Division And Related Problems
inferredcites →https://doi.org/10.1109/sfcs.1985.49openalex-snapshot
Separating the polynomial-time hierarchy by oracles
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
inferredcites →https://doi.org/10.1137/0206030openalex-snapshot
A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions
inferredcites →https://doi.org/10.1137/0206054openalex-snapshot
On Relating Time and Space to Size and Depth
inferredcites →https://doi.org/10.1137/0210057openalex-snapshot
Limitations on Separating Nondeterministic Complexity Classes
inferredcites →https://doi.org/10.1137/0213030openalex-snapshot
Quantitative Relativizations of 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.1007/3-540-45061-0_62openalex-snapshot
Oracle Circuits for Branching-Time Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_54openalex-snapshot
Oracles versus proof techniques that do not relativize
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_192openalex-snapshot
Characterizations of some complexity classes between Θ2p and Δ2p
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_150openalex-snapshot
On adaptive dlogtime and polylogtime reductions
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_151openalex-snapshot
NCk(NP)=AC k−1(NP)
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_79openalex-snapshot
On parallel hierarchies and R ki
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_36openalex-snapshot
A note on the relation between polynomial time functionals and Constable's class K
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_29openalex-snapshot
Relativizing Small Complexity Classes and Their Theories
inferred← citeshttps://doi.org/10.1007/978-3-662-03927-4_2openalex-snapshot
Complexity Measures and Reductions
inferred← citeshttps://doi.org/10.1007/978-94-009-2411-6_4openalex-snapshot
On One-Way Functions
inferred← citeshttps://doi.org/10.1007/bf01191473openalex-snapshot
Adaptive logspace reducibility and parallel time
inferred← citeshttps://doi.org/10.1007/bfb0020817openalex-snapshot
Functional oracle queries as a measure of parallel time
inferred← citeshttps://doi.org/10.1007/bfb0036168openalex-snapshot
The complexity class θp2: Recent results and applications in AI and modal logic
inferred← citeshttps://doi.org/10.1007/s00037-015-0113-8openalex-snapshot
Relativizing small complexity classes and their theories
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90225-kopenalex-snapshot
Circuit depth relative to a random oracle
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90031-1openalex-snapshot
A measure of relativized space which is faithful with respect to depth
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90168-hopenalex-snapshot
Positive relativizations for log space computability
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00033-sopenalex-snapshot
On adaptive DLOGTIME and POLYLOGTIME reductions
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00035-3openalex-snapshot
On parallel hierarchies and Rki
inferred← citeshttps://doi.org/10.1051/ita/1996300100011openalex-snapshot
Relationships among $PL$, $\#L$, and the determinant
inferred← citeshttps://doi.org/10.1051/ita/1996300201011openalex-snapshot
Complexity classes between $\Theta _k^P$ and $\Delta _k^P$
inferred← citeshttps://doi.org/10.1109/ccc.1996.507666openalex-snapshot
Collapsing oracle-tape hierarchies
inferred← citeshttps://doi.org/10.1109/icci.1992.227703openalex-snapshot
Parallel self-reducibility
inferred← citeshttps://doi.org/10.1109/lics.1995.523245openalex-snapshot
Relativized logspace and generalized quantifiers over finite structures
inferred← citeshttps://doi.org/10.1109/sct.1989.41818openalex-snapshot
Decomposing NC and AC
inferred← citeshttps://doi.org/10.1109/sct.1990.113961openalex-snapshot
Width-bounded reducibility and binary search over complexity classes
inferred← citeshttps://doi.org/10.1109/sct.1991.160267openalex-snapshot
Adaptive logspace and depth-bounded reducibilities
inferred← citeshttps://doi.org/10.1109/sct.1994.315797openalex-snapshot
Relationships among PL, #L, and the determinant
inferred← citeshttps://doi.org/10.1137/0219024openalex-snapshot
On the Decomposability of $NC$ and $AC$
inferred← citeshttps://doi.org/10.1145/201019.201031openalex-snapshot
NP trees and Carnap's modal logic
inferred← citeshttps://doi.org/10.2307/2275546openalex-snapshot
Relativized logspace and generalized quantifiers over finite ordered structures
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.