Skip to search formSkip to main contentSkip to account menu

Blum axioms

Known as: Blum, Blum complexity axioms, Complexity measure 
In computational complexity theory the Blum axioms or Blum complexity axioms are axioms that specify desirable properties of complexity measures on… 
Wikipedia (opens in a new tab)

Related topics

Related topics

16 relations
Algorithmic information theoryBlum's speedup theoremComplexityComplexity class

Broader (1)

Structural complexity theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2010
Review
2010
Drought effects and water use efficiency: improving crop production in dry environments
There is global concern over our capacity to feed a rapidly growing world population against a background of climate change and a… 
Highly Cited
2009
Highly Cited
2009
Planar and Grid Graph Reachability Problems
AbstractWe study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for $\mathsf… 
2008
2008
Estimating software size with UML models
Function points have been used for more than 25 years for estimating software size and building productivity models. Today, three… 
Highly Cited
2005
Highly Cited
2005
Security parallels between people and pervasive devices
  • Stephen A. Weis
  • Third IEEE International Conference on Pervasive…
  • 2005
  • Corpus ID: 1646419
Unique and challenging security problems arise due to the scarcity of computational, storage, and power resources in the low-cost… 
Highly Cited
2005
Highly Cited
2005
Image complexity measure: a human criterion free approach
This paper describes a novel fuzzy approach to determine the complexity of an image. The proposed method determines image… 
Highly Cited
2003
Highly Cited
2003
The chaos of software development
  • A. HassanR. Holt
  • Sixth International Workshop on Principles of…
  • 2003
  • Corpus ID: 18863043
We present a new perspective on the problem of complexity in software, using sound mathematical concepts from information theory… 
2003
2003
Virtual Examples for Text Classification with Support Vector Machines
We explore how virtual examples (artificially created examples) improve performance of text classification with Support Vector… 
2001
2001
Laboratory Bioassay for Phytotoxicity
Allelopathy involves complex plant x plant chemical interactions. Although a large number of laboratory bioassays have proposed… 
Highly Cited
1995
Highly Cited
1995
Characterising the complexity of neuronal interactions
This work addresses the complexity of neuronal interactions, the nature of this complexity and how it can be characterised in… 
1981
1981
First General-Purpose Electronic Computer
The conception, development, and design of the ENIAC are presented in the context of a causal history. Early influences… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)