On the public citation graph
Reducing the Number of Solutions of NP 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-44612-5_42openalex-snapshot
On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems
inferredcites →https://doi.org/10.1007/978-1-4612-1872-2openalex-snapshot
Complexity Theory Retrospective II
inferredcites →https://doi.org/10.1007/bfb0036186openalex-snapshot
Query order in the polynomial hierarchy
inferredcites →https://doi.org/10.1007/s000370050007openalex-snapshot
Symmetric alternation captures BPP
inferredcites →https://doi.org/10.1007/s002360050109openalex-snapshot
Easy sets and hard certificate schemes
inferredcites →https://doi.org/10.1016/0020-0190(96)00016-6openalex-snapshot
More on BPP and the Polynomial-time Hierarchy
inferredcites →https://doi.org/10.1016/0020-0190(96)00030-0openalex-snapshot
Functions computable with limited access to NP
inferredcites →https://doi.org/10.1016/0022-0000(83)90013-2openalex-snapshot
On self-reducibility and weak P-selectivity
inferredcites →https://doi.org/10.1016/0022-0000(83)90027-2openalex-snapshot
A low and a high hierarchy within NP
inferredcites →https://doi.org/10.1016/0022-0000(85)90053-4openalex-snapshot
Qualitative relativizations of complexity classes
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(92)90125-yopenalex-snapshot
A uniform approach to define complexity classes
inferredcites →https://doi.org/10.1016/j.tsc.2005.03.012openalex-snapshot
Subtractive reductions and complete problems for counting complexity classes
inferredcites →https://doi.org/10.1016/s0020-0190(98)00024-6openalex-snapshot
A note on parallel queries and the symmetric-difference hierarchy
inferredcites →https://doi.org/10.1016/s0022-0000(05)80009-1openalex-snapshot
A taxonomy of complexity classes of functions
inferredcites →https://doi.org/10.1016/s0304-3975(98)00060-7openalex-snapshot
A hierarchy based on output multiplicity
inferredcites →https://doi.org/10.1070/im1994v042n02abeh001537openalex-snapshot
RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS
inferredcites →https://doi.org/10.1109/ccc.2001openalex-snapshot
Proceedings 16th Annual IEEE Conference on Computational Complexity
inferredcites →https://doi.org/10.1109/clustr.2001openalex-snapshot
Proceedings 42nd IEEE Symposium on Foundations of Computer Science
inferredcites →https://doi.org/10.1137/0213030openalex-snapshot
Quantitative Relativizations of Complexity Classes
inferredcites →https://doi.org/10.1137/0217078openalex-snapshot
The Boolean Hierarchy I: Structural Properties
inferredcites →https://doi.org/10.1137/s0097539794268315openalex-snapshot
Computing Solutions Uniquely Collapses the Polynomial Hierarchy
inferredcites →https://doi.org/10.1137/s0097539795296206openalex-snapshot
New Collapse Consequences of NP Having Small Circuits
inferredcites →https://doi.org/10.48550/arxiv.cs/9910004openalex-snapshot
An Introduction to Query Order
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-44612-5openalex-snapshot
Mathematical foundations of computer science 2000 : 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28-September 1, 2000 : proceedings
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_35openalex-snapshot
Reducing the Number of Solutions of NP Functions
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_42openalex-snapshot
On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_13openalex-snapshot
The Complexity of Finding Top-Toda-Equivalence-Class Members
inferred← citeshttps://doi.org/10.1007/s00224-004-1114-1openalex-snapshot
NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems
inferred← citeshttps://doi.org/10.1007/s00224-005-1211-9openalex-snapshot
The Complexity of Finding Top-Toda-Equivalence-Class Members
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.02.001openalex-snapshot
The consequences of eliminating NP solutions
inferred← citeshttps://doi.org/10.1137/s0097539703427550openalex-snapshot
Algebraic Properties for Selector Functions
inferred← citeshttps://doi.org/10.1145/1122480.1122495openalex-snapshot
Open questions in the theory of semifeasible computation
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.