Blum axioms
In computational complexity theory the Blum axioms or Blum complexity axioms are axioms that specify desirable properties of complexity measures on the set of computable functions. The axioms were first defined by Manuel Blum in 1967. Importantly, the Speedup and Gap theorems hold for any complexity measure satisfying these axioms. The most well-known measures satisfying these axioms are those of time (i.e., running time) and space (i.e., memory usage).
Wikipage disambiguates
primaryTopic
Blum axioms
In computational complexity theory the Blum axioms or Blum complexity axioms are axioms that specify desirable properties of complexity measures on the set of computable functions. The axioms were first defined by Manuel Blum in 1967. Importantly, the Speedup and Gap theorems hold for any complexity measure satisfying these axioms. The most well-known measures satisfying these axioms are those of time (i.e., running time) and space (i.e., memory usage).
has abstract
In computational complexity th ...... nd space (i.e., memory usage).
@en
Na teoria da complexidade comp ...... aço (ou seja, uso de memória).
@pt
В теории сложности вычислений ...... м используемой памяти (SPACE).
@ru
計算複雑性理論におけるブラムの公理(ブラムのこうり、英: B ...... もよく知られているものとしては時間複雑性と空間複雑性がある。
@ja
Wikipage page ID
Wikipage revision ID
678,367,190
hypernym
comment
In computational complexity th ...... nd space (i.e., memory usage).
@en
Na teoria da complexidade comp ...... aço (ou seja, uso de memória).
@pt
В теории сложности вычислений ...... м используемой памяти (SPACE).
@ru
計算複雑性理論におけるブラムの公理(ブラムのこうり、英: B ...... もよく知られているものとしては時間複雑性と空間複雑性がある。
@ja
label
Axiomas de Blum
@pt
Blum axioms
@en
Аксиомы Блюма
@ru
ブラムの公理
@ja