On the public citation graph
Structural analysis of the complexity of inverse functions
0 signed · 36 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-52921-7_53openalex-snapshot
Structural analyses on the complexity of inverting functions
inferredcites →https://doi.org/10.1007/bf02090391openalex-snapshot
On polynomial-time truth-table reducibility of intractable sets to P-selective sets
inferredcites →https://doi.org/10.1007/bfb0029598openalex-snapshot
One-way functions in complexity theory
inferredcites →https://doi.org/10.1016/0020-0190(76)90097-1openalex-snapshot
Relative complexity of checking and evaluating
inferredcites →https://doi.org/10.1016/0022-0000(88)90037-2openalex-snapshot
Probabilistic quantifiers and games
inferredcites →https://doi.org/10.1016/0022-0000(88)90039-6openalex-snapshot
The complexity of optimization problems
inferredcites →https://doi.org/10.1016/0022-0000(89)90020-2openalex-snapshot
Probabilistic complexity classes and lowness
inferredcites →https://doi.org/10.1016/0304-3975(75)90016-xopenalex-snapshot
A comparison of polynomial time reducibilities
inferredcites →https://doi.org/10.1016/0304-3975(86)90135-0openalex-snapshot
NP is as easy as detecting unique solutions
inferredcites →https://doi.org/10.1016/0304-3975(87)90132-0openalex-snapshot
A comparison of polynomial time completeness notions
inferredcites →https://doi.org/10.1016/s0022-0000(05)80009-1openalex-snapshot
A taxonomy of complexity classes of functions
inferredcites →https://doi.org/10.1109/psct.1987.10319246openalex-snapshot
Probabilistic Complexity Classes and Lowness
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.5287openalex-snapshot
The polynomial time hierarchy collapses if the Boolean hierarchy collapses
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/0217018openalex-snapshot
Complexity Measures for Public-Key Cryptosystems
inferredcites →https://doi.org/10.1137/0218031openalex-snapshot
On Tally Relativizations of $BP$-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/jcss.1996.0061openalex-snapshot
P-Selective Sets and Reducing Search to Decision vs Self-Reducibility
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_40openalex-snapshot
On using oracles that compute values
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_166openalex-snapshot
Computing solutions uniquely collapses the polynomial hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_7openalex-snapshot
The complexity of generating and checking proofs of membership
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_7openalex-snapshot
The Complexity of Obtaining Solutions for Problems in NP and NL
inferred← citeshttps://doi.org/10.1007/bfb0023452openalex-snapshot
Resource-bounded kolmogorov complexity revisited
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00034-4openalex-snapshot
Relativized worlds with an infinite hierarchy
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80009-1openalex-snapshot
A taxonomy of complexity classes of functions
inferred← citeshttps://doi.org/10.1109/ccc.1997.612295openalex-snapshot
Six hypotheses in search of a theorem
inferred← citeshttps://doi.org/10.1109/sct.1993.336541openalex-snapshot
P-selective sets, and reducing search to decision vs. self-reducibility
inferred← citeshttps://doi.org/10.1109/sct.1994.315819openalex-snapshot
On functions computable with nonadaptive queries to NP
inferred← citeshttps://doi.org/10.1137/17m1130538openalex-snapshot
Derandomizing Isolation in Space-Bounded Settings
inferred← citeshttps://doi.org/10.1137/s0097539793247439openalex-snapshot
Oracles That Compute Values
inferred← citeshttps://doi.org/10.1137/s0097539794268315openalex-snapshot
Computing Solutions Uniquely Collapses the Polynomial Hierarchy
inferred← citeshttps://doi.org/10.1137/s009753979834388xopenalex-snapshot
Resource-Bounded Kolmogorov Complexity Revisited
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.