On the public citation graph

p-Projection reducibility and the complexity classes ℒ (nonuniform) and Nℒ (nonuniform)

https://doi.org/10.1007/bfb0016279
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.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
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.1979.34openalex-snapshot
Random walks, universal traversal sequences, and the complexity of maze problems
inferredcites →https://doi.org/10.1109/sfcs.1981.3openalex-snapshot
A complexity theory based on Boolean algebra
inferredcites →https://doi.org/10.1109/sfcs.1981.35openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1137/0206054openalex-snapshot
On Relating Time and Space to Size and Depth
inferredcites →https://doi.org/10.1137/0213028openalex-snapshot
Constant Depth Reducibility
inferredcites →https://doi.org/10.1145/3149.3158openalex-snapshot
A complexity theory based on Boolean algebra

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-18740-5_65openalex-snapshot
The power of nondeterminism in polynomial-size bounded-width branching programs
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_82openalex-snapshot
Switching graphs and their complexity
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_77openalex-snapshot
Upper and lower bounds for certain GRAPH-ACCESSIBILITY-PROBLEMs on bounded alternating ω-BRANCHING PROGRAMs
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_107openalex-snapshot
Lower bounds for the modular communication complexity of various graph accessibility problems
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_136openalex-snapshot
Lower bounds for the majority communication complexity of various graph accessibility problems
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_41openalex-snapshot
On Measures of Space over Real and Complex Numbers
inferred← citeshttps://doi.org/10.1007/bf01301969openalex-snapshot
Lower bounds for the majority communication complexity of various graph accessibility problems
inferred← citeshttps://doi.org/10.1007/bfb0029596openalex-snapshot
Restricted branching programs and their computational power
inferred← citeshttps://doi.org/10.1007/bfb0035834openalex-snapshot
The power of polynomial size Ω-branching programs
inferred← citeshttps://doi.org/10.1007/s00453-023-01114-2openalex-snapshot
Parameterised Counting in Logspace
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90093-dopenalex-snapshot
Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90073-4openalex-snapshot
The power of nondeterminism in polynomial- size bounded-width branching programs
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90021-sopenalex-snapshot
Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90151-5openalex-snapshot
A survey of space complexity
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90046-kopenalex-snapshot
Polynomial size Ω-branching programs and their computational power
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90046-iopenalex-snapshot
Branching programs provide lower bounds on the areas of multilective deterministic and nondeterministic VLSI-circuits
inferred← citeshttps://doi.org/10.1051/ita/1992260403451openalex-snapshot
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
inferred← citeshttps://doi.org/10.1109/sct.1988.5261openalex-snapshot
Logspace self-reducibility
inferred← citeshttps://doi.org/10.1109/sct.1989.41831openalex-snapshot
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
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.