Complexity (journal)

Complexity (journal)
Complexity (journal)  
Complexity-journal-covers.jpg
Discipline Complex Systems
Language English
Edited by Peter Schuster, Alfred Hübler
Publication details
Publisher John Wiley & Sons
Publication history 1995–present
Frequency Bimonthly
Impact factor
(2009)
0.948
Indexing
ISSN 1076-2787 (print)
1099-0526 (web)
LCCN 95641033
CODEN COMPFS
OCLC number 30446118
Links

Complexity is a peer-reviewed scientific journal covering research in the field of complex adaptive systems. The journal's scope includes studies on chaos, genetic algorithms, cellular automata, neural networks, and evolutionary game theory. Notable contributors include Nobel Prize laureates such as Philip Warren Anderson,[1] Murray Gell-Mann,[2] Gerard 't Hooft,[3] and Paul Lauterbur.[4]

Complexity is issued bimonthly and its contents can be accessed online.

Contents

Abstracting and indexing

Complexity is abstracted and indexed in Computer Abstracts International Database, CompuScience Database, Computer Science Index, Inspec, Mathematical Reviews, Scopus, and the Web of Science.

See also

  • List of systems science journals

References

  1. ^ Anderson, P. W. (1997). "Is measurement itself an emergent property?". Complexity 3: 14–16. doi:10.1002/(SICI)1099-0526(199709/10)3:1<14::AID-CPLX5>3.0.CO;2-E. 
  2. ^ Gell‐Mann, M. (1997). "Fundamental sources of unpredictability". Complexity 3: 9–13. doi:10.1002/(SICI)1099-0526(199709/10)3:1<9::AID-CPLX4>3.0.CO;2-9. 
  3. ^ `t Hooft, G. (1997). "Complexity in quantum gravity". Complexity 3: 36–37. doi:10.1002/(SICI)1099-0526(199709/10)3:1<36::AID-CPLX11>3.0.CO;2-X. 
  4. ^ Lauterbur, P. C. (2005). "Demystifying biology: Did life begin as a complex system?". Complexity 11: 30–35. doi:10.1002/cplx.20097.  edit

External links


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Complexity, Problem Solving, and Sustainable Societies — is a paper on energy economics by Joseph Tainter from 1996. Contents 1 Focus 1.1 Attempts 1.2 Requirement of knowledge 2 See …   Wikipedia

  • COMPLEXITY — Journal of Complexity (informationswissenschaftl. Veoeffentlichungen) …   Acronyms

  • COMPLEXITY — Journal of Complexity (informationswissenschaftl. Veröffentlichungen) …   Acronyms von A bis Z

  • Complexity economics — Economics …   Wikipedia

  • Complexity — For other uses, see Complexity (disambiguation). In general usage, complexity tends to be used to characterize something with many parts in intricate arrangement. The study of these complex linkages is the main goal of complex systems theory. In… …   Wikipedia

  • Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… …   Wikipedia

  • Evolution of complexity — The evolution of complexity is an important outcome of the process of evolution. Evolution has produced some remarkably complex organisms although this feature is hard to measure accurately in biology, with properties such as gene content, the… …   Wikipedia

  • Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… …   Wikipedia

  • Cyclomatic complexity — (or conditional complexity) is a software metric (measurement). It was developed by Thomas J. McCabe, Sr. in 1976 and is used to indicate the complexity of a program. It directly measures the number of linearly independent paths through a program …   Wikipedia

  • Computational Complexity — may refer to: Computational complexity theory Computational Complexity (journal) This disambiguation page lists articles associated with the same title. If an internal link led you here, you may wish to c …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”