Computational complexity theory/Related Articles
From Citizendium, the Citizens' Compendium
- See also changes related to Computational complexity theory, or pages that link to Computational complexity theory or to this page or whose text .
Auto-populated based on Special:WhatLinksHere/Computational complexity theory. Needs checking by a human.
- Algorithm : A sequence of steps used to solve a problem.
- Asymmetric key cryptography : A category of cryptographic techniques, which greatly simplify key management, which are based on mathematically related key pairs, such that the "public" key can be used to encrypt and be freely available, and only the holder of the "private" key can decrypt the message
- Big O notation : Mathematical notation to express various upper bounds concerning asymptotic behaviour of functions, e.g. the complexity of algorithms in computer science.
- Brute force attack : An attempt to break a cipher by trying all possible keys; long enough keys make this impractical.
- Complexity of algorithms : How fast the execution time (or memory usage) increases as the data set to be processed grows.
- Cryptography : A field at the intersection of mathematics and computer science that is concerned with the security of information, typically the confidentiality, integrity and authenticity of some message.
- Digital object identifier : Unique label for a computer readable object that can be found on the internet, usually used in academic journals.
- Exponential growth : Increase of a quantity x with time t according to the equation x = Kat, where K and a are constants, a is greater than 1, and K is greater than 0.
- Integrated circuit : Miniaturized electronic circuit that has been manufactured in the surface of a thin substrate of semiconductor material.
- MPEG-1 : One of the earliest practical standards for high quality, low bitrate audio and video compression; includes the MP3 audio format.
- Mathematics : The study of quantities, structures, their relations, and changes thereof.
- NP complexity class : Class of decision problems that can be solved in nondeterministic polynomial time or, equivalently, can be checked in polynomial time.
- Operations research : A set of quantitative techniques for optimum decisionmaking, often with uncertainty, which were first used to solve military operational problems
- Pi (mathematical constant) : Greek letter π and mathematical constant that is approximately equal to 3.14159.