Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms. Starting from the… Expand
  • table 1.1
Highly Cited
2010
Highly Cited
2010
Organizations face institutional complexity whenever they confront incompatible prescriptions from multiple institutional logics… Expand
Review
2009
Review
2009
What enables individually simple insects like ants to act with such precision and purpose as a group? How do trillions of… Expand
Highly Cited
1998
Highly Cited
1998
  • L. Blum
  • Springer New York
  • 1998
  • Corpus ID: 12510680
1 Introduction.- 2 Definitions and First Properties of Computation.- 3 Computation over a Ring.- 4 Decision Problems and… Expand
Highly Cited
1996
Highly Cited
1996
This text seeks to demonstrate what leadership means in an environment where complete control is not possible. Explaining what… Expand
Highly Cited
1991
Highly Cited
1991
A number of proposals have been advanced in recent years for the development of “general systems theory” which, abstracting from… Expand
  • figure 1
Highly Cited
1981
Highly Cited
1981
This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also… Expand
Highly Cited
1976
Highly Cited
1976
  • T. McCabe
  • IEEE Transactions on Software Engineering
  • 1976
  • Corpus ID: 9116234
This paper describes a graph-theoretic complexity measure and illustrates how it can be used to manage and control program… Expand
  • table 1
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1976
Highly Cited
1976
A new approach to the problem of evaluating the complexity ("randomness") of finite sequences is presented. The proposed… Expand
Review
1975
Review
1975
We survey and extend the results on the complexity of machine scheduling problems. After a brief review of the central concept of… Expand