Complexity

Known as: Complex, Complexity (disambiguation), Organismal complexity 
Complexity describes the behaviour of a system or model whose components interact in multiple ways and follow local rules, meaning there is no… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Classic work on interruptions by Zeigarnik showed that tasks that were interrupted were more likely to be recalled after a delay… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Want to get experience? Want to get any ideas to create new things in your life? Read discrepancy method randomness and… (More)
Is this relevant?
Review
2000
Review
2000
Nervous systems facing complex environments have to balance two seemingly opposing requirements. First, there is a need quickly… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Only for you today! Discover your favourite complexity and approximation combinatorial optimization problems and their… (More)
Is this relevant?
Review
1998
Review
1998
Conventional approaches to understanding consciousness are generally concerned with the contribution of specific brain areas or… (More)
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
It sounds good when knowing the complexity and real computation in this website. This is one of the books that many people… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
 
Is this relevant?
Highly Cited
1982
Highly Cited
1982
y p. 27, line 12: the \i" in the rst subscript of a is not dotted: for a j read aij p. 32, in the last displayed equation… (More)
Is this relevant?
Highly Cited
1979
Highly Cited
1979
  • John H. Reif
  • 20th Annual Symposium on Foundations of Computer…
  • 1979
This paper concerns the problem of moving a polyhedron through Euclidean space while avoiding polyhedral obstacles. 
Is this relevant?