On the public citation graph
Upper Bounds for the Complexity of Sparse and Tally Descriptions
0 signed · 48 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-55719-9_72openalex-snapshot
Reductions to sets of low information content
inferredcites →https://doi.org/10.1007/3-540-56279-6_78openalex-snapshot
Lowness and the complexity of sparse and tally descriptions
inferredcites →https://doi.org/10.1007/3-540-56287-7_101openalex-snapshot
On bounded truth-table, conjunctive, and randomized reductions to sparse sets
inferredcites →https://doi.org/10.1007/3-540-57182-5_15openalex-snapshot
Hausdorff reductions to sparse sets and to sets of high information content
inferredcites →https://doi.org/10.1007/3-540-57811-0_17openalex-snapshot
On self-reducible sets of low information content
inferredcites →https://doi.org/10.1007/bf00264313openalex-snapshot
Sets with small generalized Kolmogorov complexity
inferredcites →https://doi.org/10.1007/bf01185399openalex-snapshot
A refinement of the low and high hierarchies
inferredcites →https://doi.org/10.1007/bf02090392openalex-snapshot
Self-reducible sets of small density
inferredcites →https://doi.org/10.1016/0022-0000(82)90002-2openalex-snapshot
Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
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(89)90024-xopenalex-snapshot
PNP[(log )] and sparse turing-complete sets for NP
inferredcites →https://doi.org/10.1016/0022-0000(89)90025-1openalex-snapshot
The strong exponential hierarchy collapses
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(84)90111-7openalex-snapshot
Computation times of NP sets of different densities
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(93)90020-topenalex-snapshot
On sparse hard sets for counting classes
inferredcites →https://doi.org/10.1016/0304-3975(94)00016-6openalex-snapshot
Locating P/poly optimally in the extended low hierarchy
inferredcites →https://doi.org/10.1016/0890-5401(89)90029-1openalex-snapshot
Distinguishing conjunctive and disjunctive reducibilities by sparse sets
inferredcites →https://doi.org/10.1051/ita/1987210404191openalex-snapshot
The difference and truth-table hierarchies for NP
inferredcites →https://doi.org/10.1051/ita/1991250302931openalex-snapshot
Reducibilities on tally and sparse sets
inferredcites →https://doi.org/10.1109/sct.1991.160254openalex-snapshot
On one query, self-reducible sets
inferredcites →https://doi.org/10.1109/sct.1993.336524openalex-snapshot
Relativized limitations of left set technique and closure classes of sparse sets
inferredcites →https://doi.org/10.1109/sct.1993.336525openalex-snapshot
SPARSE reduces conjunctively to TALLY
inferredcites →https://doi.org/10.1137/0214003openalex-snapshot
On Circuit-Size Complexity and the Low Hierarchy in NP
inferredcites →https://doi.org/10.1137/0220030openalex-snapshot
Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
inferredcites →https://doi.org/10.1137/0221034openalex-snapshot
Relating Equivalence and Reducibility to Sparse Sets
inferredcites →https://doi.org/10.1137/0222075openalex-snapshot
On the Computational Complexity of Small Descriptions
inferredcites →https://doi.org/10.1145/147508.147546openalex-snapshot
Lower bounds for the low hierarchy
inferredcites →https://doi.org/10.1145/800141.804678openalex-snapshot
Some connections between nonuniform and uniform 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-49116-3_26openalex-snapshot
Sparse Sets, Approximable Sets, and Parallel Queries to NP
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_108openalex-snapshot
On monotonous oracle machines
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_23openalex-snapshot
Learning Reductions to Sparse Sets
inferred← citeshttps://doi.org/10.1007/bfb0055799openalex-snapshot
Average-case intractability vs. worst-case intractability
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00138-3openalex-snapshot
On reductions to sets that avoid EXPSPACE
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00016-6openalex-snapshot
Locating P/poly optimally in the extended low hierarchy
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00073-9openalex-snapshot
Geometric sets of low information content
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00008-3openalex-snapshot
Sparse sets, approximable sets, and parallel queries to NP
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00066-8openalex-snapshot
The structure of logarithmic advice complexity classes
inferred← citeshttps://doi.org/10.1051/ita/1996300201551openalex-snapshot
Monotonous and randomized reductions to sparse sets
inferred← citeshttps://doi.org/10.1109/sct.1995.514863openalex-snapshot
On the structure of low sets [complexity classes]
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.