On the public citation graph

Bounded query classes and the difference hierarchy

https://doi.org/10.1007/bf01620618
0 signed · 37 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.1002/malq.19650110104openalex-snapshot
Some Notions of Reducibility and Productiveness
inferredcites →https://doi.org/10.1002/malq.19870330608openalex-snapshot
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
inferredcites →https://doi.org/10.1007/bf00967201openalex-snapshot
Enumeration reducibilities
inferredcites →https://doi.org/10.1007/bf02218750openalex-snapshot
A hierarchy of sets. I
inferredcites →https://doi.org/10.1007/bfb0028832openalex-snapshot
On the boolean closure of NP
inferredcites →https://doi.org/10.1007/bfb0067135openalex-snapshot
Degrees of Unsolvability: Structure and Theory
inferredcites →https://doi.org/10.1007/bfb0090937openalex-snapshot
Hierarchies of sets and degrees below 0′
inferredcites →https://doi.org/10.1016/0012-365x(78)90145-0openalex-snapshot
Convex subsets of 2n and bounded truth-table reducibility
inferredcites →https://doi.org/10.1016/0304-3975(90)90177-jopenalex-snapshot
Bi-immunity results for cheatable sets
inferredcites →https://doi.org/10.1016/0304-3975(91)90160-4openalex-snapshot
Bounded queries to SAT and the Boolean hierarchy
inferredcites →https://doi.org/10.1016/0890-5401(88)90044-2openalex-snapshot
Polynomial terse sets
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50009-5openalex-snapshot
THE METHOD OF ALTERNATING CHAINS**This research was supported in part by the U.S. National Science Foundation under Grant GP-1842.
inferredcites →https://doi.org/10.1051/ita/1987210404191openalex-snapshot
The difference and truth-table hierarchies for NP
inferredcites →https://doi.org/10.1070/sm1979v035n03abeh001545openalex-snapshot
RELATIONSHIPS BETWEEN DIFFERENT FORMS OF RELATIVE COMPUTABILITY OF FUNCTIONS
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1109/sct.1988.5282openalex-snapshot
On truth-table reducibility to SAT and the difference hierarchy over NP
inferredcites →https://doi.org/10.1109/sct.1988.5286openalex-snapshot
Bounded query computations
inferredcites →https://doi.org/10.1137/0217078openalex-snapshot
The Boolean Hierarchy I: Structural Properties
inferredcites →https://doi.org/10.2307/2270580openalex-snapshot
Limiting recursion
inferredcites →https://doi.org/10.2307/2270581openalex-snapshot
Trial and error predicates and the solution to a problem of Mostowski
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.

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.1995.1099openalex-snapshot
Recursion Theoretic Properties of Frequency Computation and Bounded Queries
inferred← citeshttps://doi.org/10.1007/978-1-4612-4478-3_6openalex-snapshot
Self-Reducibility: Effects of Internal Structure on Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_68openalex-snapshot
Infinite Computations and a Hierarchy in Δ 3
inferred← citeshttps://doi.org/10.1007/bfb0022573openalex-snapshot
Recursion theoretic properties of frequency computation and bounded queries (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0023860openalex-snapshot
Quantifying the amount of verboseness (extended abstract)
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90077-aopenalex-snapshot
The Mapmaker's dilemma
inferred← citeshttps://doi.org/10.1016/0168-0072(89)90010-9openalex-snapshot
Nondeterministic bounded query reducibilities
inferred← citeshttps://doi.org/10.1016/0168-0072(89)90029-8openalex-snapshot
On the complexity of finding the chromatic number of a recursive graph I: the bounded case
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(91)90160-4openalex-snapshot
Bounded queries to SAT and the Boolean hierarchy
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00031-qopenalex-snapshot
On quasilinear-time complexity theory
inferred← citeshttps://doi.org/10.1109/sct.1988.5282openalex-snapshot
On truth-table reducibility to SAT and the difference hierarchy over NP
inferred← citeshttps://doi.org/10.1109/sct.1991.160245openalex-snapshot
Bounded queries in recursion theory: a survey
inferred← citeshttps://doi.org/10.1145/276698.276720openalex-snapshot
One help-bit doesn't help
inferred← citeshttps://doi.org/10.2307/2275299openalex-snapshot
A proof of Beigel's cardinality conjecture
inferred← citeshttps://doi.org/10.2307/2586523openalex-snapshot
The complexity of ODDnA
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.