Blum complexity measures
E117702
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
All labels observed (4)
| Label | Occurrences |
|---|---|
| A Machine-Independent Theory of the Complexity of Recursive Functions | 1 |
| Blum complexity measure | 1 |
| Blum complexity measures canonical | 1 |
| Levin complexity | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T990926 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Blum complexity measures Context triple: [Manuel Blum, notableWork, Blum complexity measures]
-
A.
The Knowledge Complexity of Interactive Proof Systems
"The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
-
B.
Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
-
C.
Interactive Proofs and the Hardness of Approximating Cliques
"Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
-
D.
PCP theorem
The PCP theorem is a fundamental result in computational complexity theory stating that every problem in NP has probabilistically checkable proofs that can be verified by examining only a constant number of bits, with major implications for the hardness of approximation.
-
E.
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing is a 1985 ACM conference volume collecting influential research papers in theoretical computer science, including foundational work on topics such as interactive proof systems and computational complexity.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Blum complexity measures Target entity description: Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
-
A.
The Knowledge Complexity of Interactive Proof Systems
"The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
-
B.
Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
-
C.
Interactive Proofs and the Hardness of Approximating Cliques
"Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
-
D.
PCP theorem
The PCP theorem is a fundamental result in computational complexity theory stating that every problem in NP has probabilistically checkable proofs that can be verified by examining only a constant number of bits, with major implications for the hardness of approximation.
-
E.
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing is a 1985 ACM conference volume collecting influential research papers in theoretical computer science, including foundational work on topics such as interactive proof systems and computational complexity.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
axiomatic framework
ⓘ
complexity measure ⓘ formal framework in computational complexity theory ⓘ |
| allows |
definition of general resource-bounded computability
ⓘ
machine-independent definition of space complexity ⓘ machine-independent definition of time complexity ⓘ |
| appliesTo |
Turing machine computations
ⓘ
partial recursive functions ⓘ |
| assumes | effective enumeration of partial recursive functions ⓘ |
| axiom1 | complexity is defined exactly on halting computations ⓘ |
| axiom2 | set of triples (program,input,complexity) is decidable ⓘ |
| basedOn | axiomatic conditions ⓘ |
| characterizes |
other resource bounds
ⓘ
space complexity ⓘ time complexity ⓘ |
| constrains | domain of φ to halting computations ⓘ |
| defines | axioms for complexity measures ⓘ |
| describedBy | Blum axioms ⓘ |
| ensures |
independence from specific machine models
ⓘ
robustness of complexity-theoretic definitions ⓘ |
| field |
computational complexity theory
ⓘ
linked to:
Complexity Theory
theoretical computer science ⓘ |
| formalizes | resource usage of algorithms ⓘ |
| generalizes |
space-constructible functions
ⓘ
time-constructible functions ⓘ |
| hasAxiom |
Blum axioms
ⓘ
decidability condition ⓘ domain condition ⓘ |
| hasComponent | complexity function φ(i,x) ⓘ |
| implies | existence of complete problems for many complexity classes ⓘ |
| influenced |
definition of many complexity classes
ⓘ
development of abstract complexity theory ⓘ |
| introducedBy | Manuel Blum ⓘ |
| introducedIn | 1960s ⓘ |
| namedAfter | Manuel Blum ⓘ |
| purpose |
to compare complexity of algorithms abstractly
ⓘ
to formalize resource usage of algorithms ⓘ |
| relatedTo |
Kolmogorov complexity
ⓘ
invariance theorem ⓘ speedup theorem ⓘ |
| requires | decidability of the complexity predicate ⓘ |
| usedFor |
defining complexity classes abstractly
ⓘ
defining complexity-theoretic hierarchies ⓘ defining optimal algorithms relative to a measure ⓘ defining speedup theorems ⓘ proving invariance theorems ⓘ studying tradeoffs between resources ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Blum complexity measures Description of subject: Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Blum complexity measures
linked to: Blum complexity measures
linked to: Blum complexity measures