On the public citation graph
Sets with small generalized Kolmogorov complexity
0 signed · 86 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-16078-7_86openalex-snapshot
On sparse oracles separating feasible complexity classes
inferredcites →https://doi.org/10.1007/3-540-16486-3_85openalex-snapshot
The complexity of sparse sets in P
inferredcites →https://doi.org/10.1007/bfb0030298openalex-snapshot
Sparse oracles, lowness, and highness
inferredcites →https://doi.org/10.1016/0020-0190(88)90176-7openalex-snapshot
On sparse oracles separating feasible complexity classes
inferredcites →https://doi.org/10.1016/0022-0000(81)90009-xopenalex-snapshot
An information-theoretic approach to time bounds for on-line computation
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/0304-3975(85)90168-9openalex-snapshot
On bounded query machines
inferredcites →https://doi.org/10.1016/0885-064x(85)90012-3openalex-snapshot
Continuous optimization problems and a polynomial hierarchy of real functions
inferredcites →https://doi.org/10.1080/00207166808803030openalex-snapshot
Three approaches to the quantitative definition of information *
inferredcites →https://doi.org/10.1109/sfcs.1983.21openalex-snapshot
Generalized Kolmogorov complexity and the structure of feasible computations
inferredcites →https://doi.org/10.1137/0212037openalex-snapshot
Positive Relativizations of Complexity Classes
inferredcites →https://doi.org/10.1137/0213030openalex-snapshot
Quantitative Relativizations of Complexity Classes
inferredcites →https://doi.org/10.1137/0214003openalex-snapshot
On Circuit-Size Complexity and the Low Hierarchy in NP
inferredcites →https://doi.org/10.1137/0214043openalex-snapshot
On Restricting the Size of Oracles Compared with Restricting Access to Oracles
inferredcites →https://doi.org/10.1137/0217038openalex-snapshot
Erratum: On Restricting the Size of Oracles Compared with Restricting Access to Oracles
inferredcites →https://doi.org/10.1145/321356.321363openalex-snapshot
On the Length of Programs for Computing Finite Binary Sequences
inferredcites →https://doi.org/10.1145/321495.321506openalex-snapshot
On the Length of Programs for Computing Finite Binary Sequences
inferredcites →https://doi.org/10.1145/321832.321839openalex-snapshot
Information-Theoretic Limitations of Formal Systems
inferredcites →https://doi.org/10.1145/321892.321894openalex-snapshot
A Theory of Program Size Formally Identical to Information Theory
inferredcites →https://doi.org/10.1145/5925.5938openalex-snapshot
Relativizing complexity classes with sparse oracles
inferredcites →https://doi.org/10.1145/800061.808762openalex-snapshot
A complexity theoretic approach to randomness
inferredcites →https://doi.org/10.1145/800141.804685openalex-snapshot
An information-theoretic approach to time bounds for on-line computation (preliminary version)
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.1996.0017openalex-snapshot
Completeness and Weak Completeness under Polynomial-Size Circuits
inferred← citeshttps://doi.org/10.1006/jcss.1995.1037openalex-snapshot
Bounding the Complexity of Advice Functions
inferred← citeshttps://doi.org/10.1007/3-540-16486-3_85openalex-snapshot
The complexity of sparse sets in P
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_144openalex-snapshot
Separating polynomial-time turing and truth-table reductions by tally sets
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_78openalex-snapshot
Lowness and the complexity of sparse and tally descriptions
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_87openalex-snapshot
Degrees and reducibilities of easy tally sets
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_59openalex-snapshot
Completeness and weak completeness under polynomial-size circuits
inferred← citeshttps://doi.org/10.1007/978-0-387-49820-1_7openalex-snapshot
Resource-Bounded Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_3openalex-snapshot
Coding Complexity: The Computational Complexity of Succinct Descriptions
inferred← citeshttps://doi.org/10.1007/978-1-4757-2606-0_7openalex-snapshot
Resource-Bounded Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_36openalex-snapshot
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-77735-6_3openalex-snapshot
On Sets with Small Information Content
inferred← citeshttps://doi.org/10.1007/978-3-642-77735-6_4openalex-snapshot
Kolmogorov Complexity, Complexity Cores, and the Distribution of Hardness
inferred← citeshttps://doi.org/10.1007/bf01185399openalex-snapshot
A refinement of the low and high hierarchies
inferred← citeshttps://doi.org/10.1007/bf01201814openalex-snapshot
Upper Bounds for the Complexity of Sparse and Tally Descriptions
inferred← citeshttps://doi.org/10.1007/bfb0017127openalex-snapshot
Sparse sets, tally sets, and polynomial reducibilities
inferred← citeshttps://doi.org/10.1007/bfb0017153openalex-snapshot
Strong and robustly strong polynomial time reducibilities to sparse sets
inferred← citeshttps://doi.org/10.1007/bfb0035750openalex-snapshot
Lower bounds for the low hierarchy
inferred← citeshttps://doi.org/10.1007/bfb0039591openalex-snapshot
Towards a theory of relativizations: Positive relativizations
inferred← citeshttps://doi.org/10.1007/s002360050109openalex-snapshot
Easy sets and hard certificate schemes
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90021-4openalex-snapshot
Some consequences of the existence of pseudorandom generators
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90038-mopenalex-snapshot
On the complexity of ranking
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90020-jopenalex-snapshot
Almost everywhere high nonuniform complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90138-8openalex-snapshot
Robust machines accept easy sets
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90070-iopenalex-snapshot
Strong and robustly strong polynomial-time reducibilities to sparse sets
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90388-iopenalex-snapshot
On sets polynomially enumerable by iteration
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90318-aopenalex-snapshot
Separating complexity classes with tally oracles
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90256-sopenalex-snapshot
Circuit size relative to pseudorandom oracles
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/0890-5401(89)90029-1openalex-snapshot
Distinguishing conjunctive and disjunctive reducibilities by sparse sets
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90052-jopenalex-snapshot
Kolmogorov complexity and degrees of tally sets
inferred← citeshttps://doi.org/10.1016/b978-1-55860-146-8.50009-6openalex-snapshot
ON THE COMPLEXITY OF LEARNING MINIMUM TIME-BOUNDED TURING MACHINES11Research supported in part by the NSF Grant CCR-8801575.
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.015openalex-snapshot
All superlinear inverse schemes are coNP-hard
inferred← citeshttps://doi.org/10.1051/ita/1991250302931openalex-snapshot
Reducibilities on tally and sparse sets
inferred← citeshttps://doi.org/10.1051/ita/1996300201011openalex-snapshot
Complexity classes between $\Theta _k^P$ and $\Delta _k^P$
inferred← citeshttps://doi.org/10.1109/optim.2012.6231921openalex-snapshot
How to infer the informational energy from small datasets
inferred← citeshttps://doi.org/10.1109/sct.1989.41813openalex-snapshot
Almost everywhere high nonuniform complexity
inferred← citeshttps://doi.org/10.1109/sct.1989.41824openalex-snapshot
The generalized Kolmogorov complexity of sets
inferred← citeshttps://doi.org/10.1109/sct.1990.113975openalex-snapshot
Circuit size relative to pseudorandom oracles
inferred← citeshttps://doi.org/10.1109/sct.1990.113976openalex-snapshot
A note on relativizing complexity classes with tally
inferred← citeshttps://doi.org/10.1109/sct.1991.160247openalex-snapshot
On the computational complexity of small descriptions
inferred← citeshttps://doi.org/10.1109/sct.1991.160264openalex-snapshot
Relating equivalence and reducibility to sparse sets
inferred← citeshttps://doi.org/10.1109/sct.1995.514863openalex-snapshot
On the structure of low sets [complexity classes]
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365713openalex-snapshot
Measure on small complexity classes, with applications for BPP
inferred← citeshttps://doi.org/10.1117/12.2640983openalex-snapshot
Small sample datasets build powerful image classification models
inferred← citeshttps://doi.org/10.1137/0217030openalex-snapshot
Lowness Properties of Sets in the Exponential-Time Hierarchy
inferred← citeshttps://doi.org/10.1137/0217056openalex-snapshot
On Sets Truth-Table Reducible to Sparse Sets
inferred← citeshttps://doi.org/10.1137/0220059openalex-snapshot
On the Complexity of Learning Minimum Time-Bounded Turing Machines
inferred← citeshttps://doi.org/10.1137/0220064openalex-snapshot
Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set
inferred← citeshttps://doi.org/10.1137/0221034openalex-snapshot
Relating Equivalence and Reducibility to Sparse Sets
inferred← citeshttps://doi.org/10.1137/0222075openalex-snapshot
On the Computational Complexity of Small Descriptions
inferred← citeshttps://doi.org/10.1145/1122480.1122495openalex-snapshot
Open questions in the theory of semifeasible computation
inferred← citeshttps://doi.org/10.1145/147508.147546openalex-snapshot
Lower bounds for the low hierarchy
inferred← citeshttps://doi.org/10.15837/ijccc.2010.3.2481openalex-snapshot
Extreme Data Mining: Inference from Small Datasets
inferred← citeshttps://doi.org/10.21236/ada300061openalex-snapshot
Polynomial-Time Semi-Rankable Sets.
inferred← citeshttps://doi.org/10.31274/rtd-180813-11836openalex-snapshot
The complexity and distribution of computationally useful problems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0410023openalex-snapshot
All Superlinear Inverse Schemes are coNP-Hard
inferred← citeshttps://doi.org/10.5555/92571.92591openalex-snapshot
On the complexity of learning minimum time-bounded Turing machines
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.