Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Complexity theory and organizations (view), Computational complexity theory (view), Quantum complexity theory (view), Descriptive complexity theory (view), Structural complexity theory (view), Geometric complexity theory (view), Sophistication (complexity theory) (view)

searching for Complexity theory 127 found (1215 total)

alternate case: complexity theory

Complex dynamic systems theory (1,877 words) [view diff] exact match in snippet view article find links to article

refer to both complexity theory and dynamic systems theory. Numerous labels such as chaos theory, complexity theory, chaos/complexity theory, dynamic systems

Diane Larsen-Freeman (2,168 words) [view diff] exact match in snippet view article find links to article

to the communicative context.[citation needed] She has found that complexity theory provides new insights into language, its acquisition, and its use

John Urry (sociologist) (1,210 words) [view diff] exact match in snippet view article

Futures. Finally, John Urry had been exploring some implications of complexity theory for the social sciences. Publications here include Global Complexity

Best, worst and average case (1,273 words) [view diff] no match in snippet view article find links to article

In computer science, best, worst, and average cases of a given algorithm express what the resource usage is at least, at most and on average, respectively

Robert Axelrod (political scientist) (734 words) [view diff] exact match in snippet view article

evolution of cooperation. His current research interests include complexity theory (especially agent-based modeling), international security, and cyber

Strategy (3,050 words) [view diff] exact match in snippet view article find links to article

conditions (order) and uncertainties (disorder) that drive action. Complexity theory posits that strategy involves execution, encompasses control and emergence

Symmetric Turing machine (610 words) [view diff] no match in snippet view article find links to article

A symmetric Turing machine is a Turing machine which has a configuration graph that is undirected (that is, configuration i yields configuration j if and

Approximation algorithm (3,126 words) [view diff] no match in snippet view article find links to article

In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems

Proof (truth) (1,273 words) [view diff] no match in snippet view article

A proof is sufficient evidence or a sufficient argument for the truth of a proposition. The concept applies in a variety of disciplines, with both the

Knuth Prize (781 words) [view diff] case mismatch in snippet view article find links to article

"ACM Awards Knuth Prize to Pioneer for Advances in Algorithms and Complexity Theory". Association for Computing Machinery. September 15, 2014. Archived

W. Brian Arthur (1,151 words) [view diff] exact match in snippet view article find links to article

California for many years. He is an authority on economics in relation to complexity theory, technology and financial markets. He has been on the external faculty

Propositional proof system (1,121 words) [view diff] case mismatch in snippet view article find links to article

J. Krajíček (1995), Bounded Arithmetic, Propositional Logic, and Complexity Theory, Cambridge University Press. J. Krajíček, Proof complexity, in: Proc

Information-based complexity (280 words) [view diff] no match in snippet view article find links to article

Information-based complexity (IBC) studies optimal algorithms and computational complexity for the continuous problems that arise in physical science,

Neil Immerman (332 words) [view diff] exact match in snippet view article find links to article

to research in model checking, database theory, and computational complexity theory. Professor Immerman is an editor of the SIAM Journal on Computing

Rigid origami (783 words) [view diff] no match in snippet view article find links to article

Rigid origami is a branch of origami which is concerned with folding structures using flat rigid sheets joined by hinges. That is, unlike in traditional

Graph isomorphism problem (4,214 words) [view diff] exact match in snippet view article find links to article

problem (retrieved June 28, 2017) "Mathematician claims breakthrough in complexity theory". Science. November 10, 2015. Babai (2015) Video of first 2015 lecture

Exact algorithm (127 words) [view diff] no match in snippet view article find links to article

In computer science and operations research, exact algorithms are algorithms that always solve an optimization problem to optimality. Unless P = NP, an

AWPP (269 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, almost wide probabilistic polynomial-time (AWPP) is a complexity class contained in PP defined via GapP functions. The

Sylvia Walby (1,479 words) [view diff] exact match in snippet view article find links to article

sociologist and social scientist known for her work in social and complexity theory, gender regimes and patriarchy, violence and society - including domestic

Quantum Aspects of Life (573 words) [view diff] exact match in snippet view article find links to article

biophysics, nanoscience, quantum chemistry, mathematical biology, complexity theory, and philosophy that are inspired by the 1944 seminal book What Is

List of lemmas (525 words) [view diff] no match in snippet view article find links to article

This following is a list of lemmas (or, "lemmata", i.e. minor theorems, or sometimes intermediate technical results factored out of proofs). See also list

Klee–Minty cube (1,613 words) [view diff] no match in snippet view article find links to article

The Klee–Minty cube or Klee–Minty polytope (named after Victor Klee and George J. Minty) is a unit hypercube of variable dimension whose corners have been

Effective complexity (184 words) [view diff] no match in snippet view article find links to article

Effective complexity is a measure of complexity defined in a 1996 paper by Murray Gell-Mann and Seth Lloyd that attempts to measure the amount of non-random

Postselection (255 words) [view diff] no match in snippet view article find links to article

In probability theory, to postselect is to condition a probability space upon the occurrence of a given event. In symbols, once we postselect for an event

Weak NP-completeness (429 words) [view diff] no match in snippet view article find links to article

In computational complexity, an NP-complete (or NP-hard) problem is weakly NP-complete (or weakly NP-hard) if there is an algorithm for the problem whose

Computational complexity of matrix multiplication (4,286 words) [view diff] exact match in snippet view article find links to article

Report). Stanford University. Le Gall, François (2014). "Algebraic complexity theory and matrix multiplication". In Katsusuke Nabeshima (ed.). Proceedings

Integrative complexity (972 words) [view diff] no match in snippet view article find links to article

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

Low-complexity art (1,013 words) [view diff] no match in snippet view article find links to article

Low-complexity art, first described by Jürgen Schmidhuber in 1997 and now established as a seminal topic within the larger field of computer science, is

Neil F. Johnson (566 words) [view diff] exact match in snippet view article find links to article

(born 1961) is an English physicist who is notable for his work in complexity theory and complex systems, spanning quantum information, econophysics, and

Open Systems & Information Dynamics (114 words) [view diff] exact match in snippet view article find links to article

Topics include quantum information theory, open systems, decoherence, complexity theory of classical and quantum systems and other models of information processing

Gap-Hamming problem (765 words) [view diff] exact match in snippet view article find links to article

Problem in communication complexity theory

Computational complexity of mathematical operations (1,576 words) [view diff] no match in snippet view article find links to article

The following tables list the computational complexity of various algorithms for common mathematical operations. Here, complexity refers to the time complexity

Master theorem (analysis of algorithms) (1,978 words) [view diff] no match in snippet view article

In the analysis of algorithms, the master theorem for divide-and-conquer recurrences provides an asymptotic analysis for many recurrence relations that

Computational complexity of mathematical operations (1,576 words) [view diff] no match in snippet view article find links to article

The following tables list the computational complexity of various algorithms for common mathematical operations. Here, complexity refers to the time complexity

ASR-complete (140 words) [view diff] exact match in snippet view article find links to article

ASR-complete is, by analogy to "NP-completeness" in complexity theory, a term to indicate that the difficulty of a computational problem is equivalent

Master theorem (analysis of algorithms) (1,978 words) [view diff] no match in snippet view article

In the analysis of algorithms, the master theorem for divide-and-conquer recurrences provides an asymptotic analysis for many recurrence relations that

Smoothed analysis (1,727 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, smoothed analysis is a way of measuring the complexity of an algorithm. Since its introduction in 2001, smoothed analysis

The Collapse of Chaos (322 words) [view diff] exact match in snippet view article find links to article

Discovering Simplicity in a Complex World (1994) is a book about complexity theory and the nature of scientific explanation written by biologist Jack

Nondeterministic constraint logic (1,691 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, nondeterministic constraint logic is a combinatorial system in which an orientation is given to the edges of a weighted

Complete coloring (614 words) [view diff] no match in snippet view article find links to article

In graph theory, a complete coloring is a (proper) vertex coloring in which every pair of colors appears on at least one pair of adjacent vertices. Equivalently

Semi-membership (380 words) [view diff] exact match in snippet view article find links to article

"Applying techniques of discrete complexity theory to numerical computation" in Ronald V. Book (ed.), "Studies in complexity theory", Research notes in theoretical

Nikos Salingaros (2,267 words) [view diff] exact match in snippet view article find links to article

polymath known for his work on urban theory, architectural theory, complexity theory, and design philosophy. He has been a close collaborator of the architect

Andrew V. Goldberg (377 words) [view diff] exact match in snippet view article find links to article

algorithms. He also worked on mechanism design, computer systems, and complexity theory. Currently he is a senior principal scientist at Amazon.com. Goldberg

Structured program theorem (2,782 words) [view diff] no match in snippet view article find links to article

The structured program theorem, also called the Böhm–Jacopini theorem, is a result in programming language theory. It states that a class of control-flow

Centre of Mathematics and Design (213 words) [view diff] exact match in snippet view article find links to article

of projects Study of urban morphologies using fractal geometry and complexity theory Analysis of the interdisciplinarity of mathematics in relation to

Proper complexity function (107 words) [view diff] no match in snippet view article find links to article

A proper complexity function is a function f mapping a natural number to a natural number such that: f is nondecreasing; there exists a k-string Turing

Computation tree (293 words) [view diff] no match in snippet view article find links to article

A computation tree is a representation for the computation steps of a non-deterministic Turing machine on a specified input. A computation tree is a rooted

Resource-bounded measure (1,048 words) [view diff] no match in snippet view article find links to article

Lutz's resource-bounded measure is a generalisation of Lebesgue measure to complexity classes. It was originally developed by Jack Lutz. Just as Lebesgue

Holy Grail (disambiguation) (273 words) [view diff] exact match in snippet view article

a theory of everything for physics, or P vs. NP for computational complexity theory) Holy Grail may also refer to: "Holy Grail" (Hunters & Collectors

Proper complexity function (107 words) [view diff] no match in snippet view article find links to article

A proper complexity function is a function f mapping a natural number to a natural number such that: f is nondecreasing; there exists a k-string Turing

Aanderaa–Karp–Rosenberg conjecture (3,557 words) [view diff] no match in snippet view article find links to article

Unsolved problem in computer science Prove or disprove Aanderaa–Karp–Rosenberg conjecture. More unsolved problems in computer science In theoretical computer

All (250 words) [view diff] exact match in snippet view article find links to article

(complexity), the class of all decision problems in computability and complexity theory ALL, a content rating given by the Game Rating and Administration

Computationally bounded adversary (1,131 words) [view diff] exact match in snippet view article find links to article

near-optimal, with a negligible error probability. These codes are used in complexity theory for things like self-correcting computations, probabilistically checkable

Nicholas Peroff (412 words) [view diff] case mismatch in snippet view article find links to article

public administrator and professor in Native American studies and Complexity Theory at the Henry W. Bloch School of Management at the University of Missouri-Kansas

Complexity index (1,473 words) [view diff] no match in snippet view article find links to article

In modern computer science and statistics, the complexity index of a function denotes the level of informational content, which in turn affects the difficulty

Minkowski's theorem (2,350 words) [view diff] no match in snippet view article find links to article

In mathematics, Minkowski's theorem is the statement that every convex set in R n {\displaystyle \mathbb {R} ^{n}} which is symmetric with respect to the

Hokky Situngkir (261 words) [view diff] exact match in snippet view article find links to article

(born February 7, 1978) is an Indonesian scientist who researches complexity theory at Surya University. He is the founder of the Bandung Fe Institute

Proof of knowledge (1,635 words) [view diff] no match in snippet view article find links to article

In cryptography, a proof of knowledge is an interactive proof in which the prover succeeds in 'convincing' a verifier that the prover knows something.

Hokky Situngkir (261 words) [view diff] exact match in snippet view article find links to article

(born February 7, 1978) is an Indonesian scientist who researches complexity theory at Surya University. He is the founder of the Bandung Fe Institute

Steven Durlauf (541 words) [view diff] exact match in snippet view article find links to article

scientists and has also challenged the ways that agent-based modelling and complexity theory have been employed by social and natural scientists to study socioeconomic

List of systems scientists (2,436 words) [view diff] exact match in snippet view article find links to article

Brian Arthur (born 1945) Irish economist, expert on economics and complexity theory in technology and financial markets, and other applications. W. Ross

Blum (160 words) [view diff] exact match in snippet view article find links to article

axioms, in computational complexity theory Blum integer, in mathematics Blum's speedup theorem, in computational complexity theory Blum (surname), including

Farkas' lemma (3,003 words) [view diff] no match in snippet view article find links to article

In mathematics, Farkas' lemma is a solvability theorem for a finite system of linear inequalities. It was originally proven by the Hungarian mathematician

PTAS (71 words) [view diff] exact match in snippet view article find links to article

reduction, an approximation-preserving reduction in computational complexity theory Preferential trading area, another term for a trade bloc PTA (disambiguation)

Pointer machine (1,556 words) [view diff] exact match in snippet view article find links to article

state table instead of a list of instructions. Use of the model in complexity theory: van Emde Boas (1990) expresses concern that this form of abstract

Lowness (94 words) [view diff] exact match in snippet view article find links to article

(complexity), a relationship between complexity classes in computational complexity theory Prince Lowness, a character in the Terrific Whatzit DC Comics stories

Elliot Saltzman (508 words) [view diff] exact match in snippet view article find links to article

include application of theories and methods of nonlinear dynamics and complexity theory to understanding the dynamical and biological bases of sensorimotor

J. Barkley Rosser Jr. (941 words) [view diff] exact match in snippet view article find links to article

applications in economics of catastrophe theory, chaos theory, and complexity theory (complex dynamics, complexity economics). With Marina V. Rosser he

Straight-line program (1,619 words) [view diff] no match in snippet view article find links to article

In computer science, a straight-line program is, informally, a program that does not contain any loop or any test, and is formed by a sequence of steps

J. Barkley Rosser Jr. (941 words) [view diff] exact match in snippet view article find links to article

applications in economics of catastrophe theory, chaos theory, and complexity theory (complex dynamics, complexity economics). With Marina V. Rosser he

O (disambiguation) (775 words) [view diff] exact match in snippet view article

{\displaystyle f=O(g)} , a Bachmann–Landau notation in computational complexity theory ("|f| is bounded above by g asymptotically") f = o ( g ) {\displaystyle

Randomness merger (1,094 words) [view diff] no match in snippet view article find links to article

In extractor theory, a randomness merger is a function which extracts randomness out of a set of random variables, provided that at least one of them is

Fernando Brandão (195 words) [view diff] exact match in snippet view article find links to article

"his highly appraised achievements in entanglement theory, quantum complexity theory, and quantum many-body physics, which combine dazzling mathematical

Yuri Gurevich (836 words) [view diff] exact match in snippet view article find links to article

Michigan, where he started to work on various aspects of computational complexity theory including average case complexity. He became one of the founders of

Multi-compartment model (2,181 words) [view diff] exact match in snippet view article find links to article

including pharmacokinetics, epidemiology, biomedicine, systems theory, complexity theory, engineering, physics, information science and social science. The

Elementary (182 words) [view diff] exact match in snippet view article find links to article

primary education ELEMENTARY, a class of objects in computational complexity theory Elementary, a widget set based on the Enlightenment Foundation Libraries

Computable topology (3,333 words) [view diff] no match in snippet view article find links to article

Computable topology is a discipline in mathematics that studies the topological and algebraic structure of computation. Computable topology is not to be

Random-access stored-program machine (2,620 words) [view diff] exact match in snippet view article find links to article

machine used for the purposes of algorithm development and algorithm complexity theory. The RASP is a random-access machine (RAM) model that, unlike the

BPP (517 words) [view diff] exact match in snippet view article find links to article

decision problems in computational complexity theory Bin packing problem a problem in computational complexity theory Biophysical profile, a prenatal ultrasound

Lempel–Ziv complexity (1,565 words) [view diff] no match in snippet view article find links to article

The Lempel–Ziv complexity is a measure that was first presented in the article On the Complexity of Finite Sequences (IEEE Trans. On IT-22,1 1976), by

Class (463 words) [view diff] exact match in snippet view article find links to article

Complexity class, a set of problems of related complexity in computational complexity theory Java class file, computer file containing Java bytecode Pseudo-class

IP (451 words) [view diff] exact match in snippet view article find links to article

connected to a computer network IP (complexity), a class in computational complexity theory IP core (intellectual property core), a reusable design unit owned

Eric Dent (473 words) [view diff] case mismatch in snippet view article find links to article

Implications of Complexity Theory conference, the second time speaking on "The Challenges of Observation, Inquiry, and Measurement in Complexity Theory." Dent

Ilya Kapovich (391 words) [view diff] exact match in snippet view article find links to article

contributions to geometric group theory, geometric topology, and complexity theory. He received his Doctor of Philosophy from the Graduate Center of

Low (343 words) [view diff] exact match in snippet view article find links to article

Launch on warning (LOW) Low (complexity), a concept in computational complexity theory Low (computability) Low (comics), an Image Comics series by Rick Remender

Healthcare error proliferation model (1,332 words) [view diff] no match in snippet view article find links to article

The healthcare error proliferation model is an adaptation of James Reason’s Swiss Cheese Model designed to illustrate the complexity inherent in the contemporary

General Electric Research Laboratory (1,482 words) [view diff] exact match in snippet view article find links to article

Laureate and physicist Juris Hartmanis, Turing Award for computational complexity theory Robert N. Hall, physicist, inventor of the first laser diode Nick

Completeness (529 words) [view diff] exact match in snippet view article find links to article

Complete (complexity), a notion referring to a problem in computational complexity theory that all other problems in a class reduce to Turing complete set,

Completeness (529 words) [view diff] exact match in snippet view article find links to article

Complete (complexity), a notion referring to a problem in computational complexity theory that all other problems in a class reduce to Turing complete set,

Wolfgang Tschacher (1,379 words) [view diff] exact match in snippet view article find links to article

systems-theoretical perspective that includes self-organization and complexity theory. He is active in the development of time series methods for the modeling

Log-rank conjecture (469 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, the log-rank conjecture states that the deterministic communication complexity of a two-party Boolean function is polynomially

James Moffat (mathematician) (278 words) [view diff] case mismatch in snippet view article

mathematician. He was a boffin in the 1982 Falklands War. He wrote Complexity Theory and Network Centric Warfare, which has 275 scholarly citations. Moffat

Folded Reed–Solomon code (4,210 words) [view diff] no match in snippet view article find links to article

In coding theory, folded Reed–Solomon codes are like Reed–Solomon codes, which are obtained by mapping m {\displaystyle m} Reed–Solomon codewords over

Grigori Tseitin (334 words) [view diff] exact match in snippet view article find links to article

transformation used in SAT solvers, Tseitin tautologies used in the proof complexity theory, and for his work on Algol 68. Tseitin studied mathematics at the

Sum (620 words) [view diff] exact match in snippet view article find links to article

addition of a sequence of numbers 3SUM, a term from computational complexity theory Band sum, a way of connecting mathematical knots Connected sum, a

Circuit (616 words) [view diff] exact match in snippet view article find links to article

computational complexity Circuit complexity, a branch of computational complexity theory Cycle (graph theory), a closed path, with no other repeated vertices

Sparse (disambiguation) (95 words) [view diff] exact match in snippet view article

tool Sparse language, a type of formal language in computational complexity theory Sparse matrix, in numerical analysis, a matrix populated primarily

Jerry Sabloff (780 words) [view diff] exact match in snippet view article find links to article

of archaeology, the relevance of archaeology in the modern world, complexity theory, and trans-disciplinary science. Sabloff received his bachelor's degree

The Hidden Connections (495 words) [view diff] exact match in snippet view article find links to article

and reductionist world views. He aims to extend system dynamics and complexity theory to the social domain and presents "a conceptual framework that integrates

Walter Clemens (2,255 words) [view diff] case mismatch in snippet view article find links to article

of post-Soviet development, Clemens wrote The Baltic Transformed: Complexity Theory and European Security (2001). Following Russia's invasions of Ukraine

Conditional proof (270 words) [view diff] exact match in snippet view article find links to article

famous network of conditional proofs is the NP-complete class of complexity theory. There is a large number of interesting tasks (see List of NP-complete

Socio-ecological system (3,897 words) [view diff] exact match in snippet view article find links to article

collective self-governance. It draws heavily on systems ecology and complexity theory. The studies of SES include some central societal concerns (e.g. equity

Computer simulation and organizational studies (1,764 words) [view diff] exact match in snippet view article find links to article

modeling, ecology, theoretical physics and thermodynamics, chaos theory, complexity theory and organization studies since these methods have also been fruitfully

Great Debates (international relations) (1,883 words) [view diff] exact match in snippet view article

Emilian Kavalski, has made significant contributions to the field of complexity theory, particularly in the areas of global governance and the decentralization

SCP (496 words) [view diff] exact match in snippet view article find links to article

Microsystems Set cover problem, a classical problem in computer science and complexity theory Save Cursor Position (ANSI), an ANSI X3.64 escape sequence Smart,

Feedback (disambiguation) (416 words) [view diff] exact match in snippet view article

eliminating directed graphs Feedback vertex set, in computational complexity theory, the feedback vertex set problem is a graph-theoretical NP-complete

Complex adaptive system (3,551 words) [view diff] case mismatch in snippet view article find links to article

problem Swarm Development Group Universal Darwinism "Insights from Complexity Theory: Understanding Organisations better". by Assoc. Prof. Amit Gupta,

Sidney Dekker (708 words) [view diff] exact match in snippet view article find links to article

builds upon theoretical foundations in resilience engineering and complexity theory, while offering practical applications for organizational leadership

Cobham (surname) (182 words) [view diff] exact match in snippet view article

(mathematician), the namesake of the Cobham's thesis in the computational complexity theory Anne Brooke, Baroness Cobham (1501–1558), English aristocrat and reported

Rp (428 words) [view diff] exact match in snippet view article find links to article

(complexity), randomized polynomial time, a class in computational complexity theory Ranked Pairs, a Condorcet voting method Real projective line Real

NE (369 words) [view diff] exact match in snippet view article find links to article

a console text editor NE (complexity), a class in computational complexity theory Network element, a manageable logical entity uniting one or more physical

SEED-SCALE (1,582 words) [view diff] exact match in snippet view article find links to article

learning, and more. SEED-SCALE is an application of emergence within complexity theory, articulating how social change "emerges" with socio-economic development

Barrington (294 words) [view diff] exact match in snippet view article find links to article

Barrington, Illinois Barrington's theorem, a result in computational complexity theory Barrington University, former name of the University of Atlanta, a

Alternation (132 words) [view diff] exact match in snippet view article find links to article

may refer to: Alternation (complexity), a resource in computational complexity theory Alternation (formal language theory), the set union of two sets of

Info-metrics (2,101 words) [view diff] exact match in snippet view article find links to article

of inference, applied mathematics, computer science, econometrics, complexity theory, decision analysis, modeling, and the philosophy of science. Info-metrics

3-dimensional matching (1,550 words) [view diff] exact match in snippet view article find links to article

matching M consists of pairwise disjoint subsets. In computational complexity theory, 3-dimensional matching (3DM) is the name of the following decision

Cem Say (491 words) [view diff] exact match in snippet view article find links to article

task relevant in the study of qualitative reasoning. His work in complexity theory includes studies on small-space quantum finite-state machines and

Intractability (73 words) [view diff] exact match in snippet view article find links to article

controlled/cured by any known treatment Intractable problem, in computational complexity theory This disambiguation page lists articles associated with the title

AC0 (769 words) [view diff] case mismatch in snippet view article find links to article

Sumant (2015). "Lecture 5: Feb 4, 2015" (PDF). E0 309: Topics in Complexity Theory. Archived (PDF) from the original on 2021-10-16. Retrieved 2021-10-16

Gerhard Werner (530 words) [view diff] exact match in snippet view article find links to article

neuroscience, especially neurodynamics, artificial intelligence, and complexity theory. During his career, and continuing after his retirement in 1989, he

Ecological psychology (1,220 words) [view diff] exact match in snippet view article find links to article

Together with a contemporary emphasis on dynamical systems theory and complexity theory as a necessary methodology for investigating the structure of ecological

QP (165 words) [view diff] exact match in snippet view article find links to article

science QP or EQP, Exact Quantum Polynomial time in computational complexity theory Akasa Air (IATA code: QP), an Indian low-cost airline qp ligature

PL (576 words) [view diff] exact match in snippet view article find links to article

truth-based propositions in terms of binary logic PL (complexity), in complexity theory Ice pellets (METAR weather code PL), a form of precipitation Picolitre

Corp (151 words) [view diff] exact match in snippet view article find links to article

trade union federation co-RP, a complexity class of computational complexity theory closely related to RP (complexity) Corps (disambiguation) This disambiguation

CC (782 words) [view diff] exact match in snippet view article find links to article

counseling company CC (complexity), a complexity class in computational complexity theory Adobe Creative Cloud, a series of subscription-based software developed

Şehzade Bayezid (son of Ahmed I) (510 words) [view diff] case mismatch in snippet view article

Leaders in Chaotic Environments: Examinations of Leadership Using Complexity Theory. Springer. p. 77. ISBN 978-3-319-44758-2. Mustafa Çağatay Uluçay (2011)

O(n) (87 words) [view diff] exact match in snippet view article

"n" or the limiting behavior of a function, e.g. in computational complexity theory The nth tensor power of Serre's twisting sheaf O ( 1 ) {\displaystyle