Complexity is a peer-reviewed open-access scientific journal covering the field of complex adaptive systems. The journal's scope includes Chaos theory...

the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly...

describe. Complexity may also refer to: Complexity (journal), a scientific journal Computational complexity, in computer science Computational complexity theory...

Complexity characterizes the behavior of a system or model whose components interact in multiple ways and follow local rules, leading to non-linearity...

theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer...

Particle Physics Journal of Physics Communications Journal of Physics: Complexity Journal of Physics: Condensed Matter (merger of Journal of Physics C: Solid...

Descriptive complexity is a branch of computational complexity theory and of finite model theory that characterizes complexity classes by the type of logic...

In computational complexity theory, SL (Symmetric Logspace or Sym-L) is the complexity class of problems log-space reducible to USTCON (undirected s-t...

In computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource (typically time) used by the...

In computational complexity theory, the exponential time hypothesis is an unproven computational hardness assumption that was formulated by Impagliazzo...

Springer) journal Computational Complexity. A symposium at B-IT in 2010 was held in honor of his 60th birthday, and a special issue of the Journal of Symbolic...

Cyclomatic complexity is a software metric used to indicate the complexity of a program. It is a quantitative measure of the number of linearly independent...

In theoretical computer science, communication complexity studies the amount of communication required to solve a problem when the input to the problem...

polynomial time", SIAM Journal on Computing, 1 (4): 281–287, doi:10.1137/0201019. Book, R. (1974), "Comparing complexity classes", Journal of Computer and System...

Combinatorial game theory measures game complexity in several ways: State-space complexity (the number of legal game positions from the initial position)...

science, and specifically proof theory and computational complexity theory, proof complexity is the field aiming to understand and analyse the computational...

In computational complexity theory, the complexity class FNP is the function problem extension of the decision problem class NP. The name is somewhat...

Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational...

In computational complexity theory, L (also known as LSPACE, LOGSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved...

encoding and decoding", in New Atlantis. Nature and Human Sciences and Complexity Journal, Year 28th – n° 2 – Jul/Dec. 2013, pp. 57–60, ISSN 2281-9495, ISBN 978-88-548-6611-9...

Project complexity is the property of a project which makes it difficult to understand, foresee, and keep under control its overall behavior, even when...

Integrative complexity is a research psychometric that refers to the degree to which thinking and reasoning involve the recognition and integration of...

science, and specifically computational complexity theory and circuit complexity, TC (Threshold Circuit) is a complexity class of decision problems that can...

In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource...

The space complexity of an algorithm or a data structure is the amount of memory space required to solve an instance of the computational problem as a...

Self-complexity is a person's perceived knowledge of themself, based upon the number of distinct cognitive structures, or self-aspects, they believe to...

The Nelson complexity index (NCI) is a measure to compare the secondary conversion capacity of a petroleum refinery with the primary distillation capacity...

in computer science In theoretical computer science, the computational complexity of matrix multiplication dictates how quickly the operation of matrix...

In computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems according...

Complexity economics is the application of complexity science to the problems of economics. It relaxes several common assumptions in economics, including...