On the public citation graph

THE OPERATORS MIN AND MAX ON THE POLYNOMIAL HIERARCHY

https://doi.org/10.1007/bfb0023451
0 signed · 40 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.1006/inco.1995.1087openalex-snapshot
The Complexity of Selecting Maximal Solutions
inferredcites →https://doi.org/10.1006/inco.1995.1109openalex-snapshot
Complexity Classes of Optimization Functions
inferredcites →https://doi.org/10.1007/978-3-642-75357-2openalex-snapshot
Structural Complexity II
inferredcites →https://doi.org/10.1007/978-3-642-79235-9openalex-snapshot
Structural Complexity I
inferredcites →https://doi.org/10.1007/bf00276023openalex-snapshot
On counting and approximation
inferredcites →https://doi.org/10.1007/bf00289117openalex-snapshot
The complexity of combinatorial problems with succinct input representation
inferredcites →https://doi.org/10.1007/bf01204168openalex-snapshot
OptP as the normal behavior of NP-complete problems
inferredcites →https://doi.org/10.1007/bfb0026095openalex-snapshot
On counting and approximation
inferredcites →https://doi.org/10.1007/bfb0036487openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1016/0022-0000(84)90068-0openalex-snapshot
The complexity of facets (and some facets of complexity)
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(93)90006-iopenalex-snapshot
A complexity theory for feasible closure properties
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0304-3975(86)90141-6openalex-snapshot
Some observations on the connection between counting and recursion
inferredcites →https://doi.org/10.1016/0304-3975(87)90049-1openalex-snapshot
More complicated questions about maxima and minima, and some closures of NP
inferredcites →https://doi.org/10.1016/0304-3975(92)90073-oopenalex-snapshot
Generalizations of Opt P to the polynomial hierarchy
inferredcites →https://doi.org/10.1016/s0022-0000(05)80082-0openalex-snapshot
Simple characterizations of P(#P) and complete problems
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1137/0220053openalex-snapshot
PP is as Hard as the Polynomial-Time Hierarchy
inferredcites →https://doi.org/10.1142/s0129054193000195openalex-snapshot
THE COMPLEXITY OF FINDING MIDDLE ELEMENTS
inferredcites →https://doi.org/10.1145/203610.203611openalex-snapshot
The satanic notations
inferredcites →https://doi.org/10.1145/211542.211543openalex-snapshot
Space-bounded probabilistic computation
inferredcites →https://doi.org/10.11501/3090148openalex-snapshot
Computational complexity of counting 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-38076-0_29openalex-snapshot
Acceptor-Definable Counting Classes
inferred← citeshttps://doi.org/10.1007/3-540-45066-1_14openalex-snapshot
On Functions and Relations
inferred← citeshttps://doi.org/10.1007/3-540-45446-2_22openalex-snapshot
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_84openalex-snapshot
The Complexity of Computing the Size of an Interval
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_44openalex-snapshot
The operators minCh and maxCh on the polynomial hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_14openalex-snapshot
On the Connection between Interval Size Functions and Path Counting
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_29openalex-snapshot
Structural Complexity of Multiobjective NP Search Problems
inferred← citeshttps://doi.org/10.1007/bfb0028595openalex-snapshot
Uniformly defining complexity classes of functions
inferred← citeshttps://doi.org/10.1007/s00037-016-0137-8openalex-snapshot
On the connection between interval size functions and path counting
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.04.007openalex-snapshot
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00142-8openalex-snapshot
A note on unambiguous function classes
inferred← citeshttps://doi.org/10.1137/s0097539705447013openalex-snapshot
The Complexity of Computing the Size of an Interval
inferred← citeshttps://doi.org/10.1142/s0129054100000326openalex-snapshot
UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS
inferred← citeshttps://doi.org/10.1142/s0129054104002273openalex-snapshot
ON HIGHER ARTHUR-MERLIN CLASSES
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0106045openalex-snapshot
A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0502058openalex-snapshot
The Complexity of Computing the Size of an Interval
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.