On the public citation graph
The Complexity of Malign Measures
0 signed · 23 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.1016/b978-0-444-88071-0.50009-6openalex-snapshot
Kolmogorov Complexity and its Applications
inferredcites →https://doi.org/10.1070/rm1970v025n06abeh001269openalex-snapshot
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
inferredcites →https://doi.org/10.1137/0219019openalex-snapshot
On the Efficient Generation of Language Instances
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcom.1999.0523openalex-snapshot
Polynomial Time Samplable Distributions
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_41openalex-snapshot
Universal Distributions and Time-Bounded Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_25openalex-snapshot
On the complexity of worst case and expected time in a circuit
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_7openalex-snapshot
Average-Case Analysis Using Kolmogorov Complexity
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-45077-1_28openalex-snapshot
Using Depth to Capture Average-Case Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-60322-8_9openalex-snapshot
Kolmogorov Complexity, the Universal Distribution, and Worst-Case vs. Average-Case
inferred← citeshttps://doi.org/10.1007/bf01262929openalex-snapshot
An average complexity measure that yields tight hierarchies
inferred← citeshttps://doi.org/10.1007/bfb0030861openalex-snapshot
Transformations that preserve malignness of universal distributions
inferred← citeshttps://doi.org/10.1007/bfb0036170openalex-snapshot
Average-case analysis via incompressibility
inferred← citeshttps://doi.org/10.1007/bfb0055799openalex-snapshot
Average-case intractability vs. worst-case intractability
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00108-oopenalex-snapshot
Some properties of sets tractable under every polynomial-time computable distribution
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.033openalex-snapshot
Computational depth: Concept and applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.06.026openalex-snapshot
Generalized juntas and NP-hard sets
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00275-7openalex-snapshot
Transformations that preserve malignness of universal distributions
inferred← citeshttps://doi.org/10.48550/arxiv.0806.2555openalex-snapshot
Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas
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.