Computational complexity theory and List of important publications in theoretical computer science

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Computational complexity theory and List of important publications in theoretical computer science

Computational complexity theory vs. List of important publications in theoretical computer science

Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. This is a list of important publications in theoretical computer science, organized by field.

Alan Turing

Alan Mathison Turing (23 June 1912 – 7 June 1954) was an English computer scientist, mathematician, logician, cryptanalyst, philosopher, and theoretical biologist.

Alan Turing and Computational complexity theory · Alan Turing and List of important publications in theoretical computer science · See more »

Algorithm

In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.

Algorithm and Computational complexity theory · Algorithm and List of important publications in theoretical computer science · See more »

Blum axioms

In computational complexity theory the Blum axioms or Blum complexity axioms are axioms that specify desirable properties of complexity measures on the set of computable functions.

Blum axioms and Computational complexity theory · Blum axioms and List of important publications in theoretical computer science · See more »

Boolean satisfiability problem

In computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated as SATISFIABILITY or SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula.

Boolean satisfiability problem and Computational complexity theory · Boolean satisfiability problem and List of important publications in theoretical computer science · See more »

Cambridge University Press

Cambridge University Press (CUP) is the publishing business of the University of Cambridge.

Cambridge University Press and Computational complexity theory · Cambridge University Press and List of important publications in theoretical computer science · See more »

Computability theory

Computability theory, also known as recursion theory, is a branch of mathematical logic, of computer science, and of the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees.

Computability theory and Computational complexity theory · Computability theory and List of important publications in theoretical computer science · See more »

Formal language

In mathematics, computer science, and linguistics, a formal language is a set of strings of symbols together with a set of rules that are specific to it.

Computational complexity theory and Formal language · Formal language and List of important publications in theoretical computer science · See more »

Interactive proof system

In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties.

Computational complexity theory and Interactive proof system · Interactive proof system and List of important publications in theoretical computer science · See more »

IP (complexity)

In computational complexity theory, the class IP (which stands for Interactive Polynomial time) is the class of problems solvable by an interactive proof system.

Computational complexity theory and IP (complexity) · IP (complexity) and List of important publications in theoretical computer science · See more »

Leonid Levin

Leonid Anatolievich Levin (Леони́д Анато́льевич Ле́вин; Леоні́д Анато́лійович Ле́він; born November 2, 1948) is a Soviet-American computer scientist.

Computational complexity theory and Leonid Levin · Leonid Levin and List of important publications in theoretical computer science · See more »

List of important publications in theoretical computer science

This is a list of important publications in theoretical computer science, organized by field.

Computational complexity theory and List of important publications in theoretical computer science · List of important publications in theoretical computer science and List of important publications in theoretical computer science · See more »

NP-completeness

In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.

Computational complexity theory and NP-completeness · List of important publications in theoretical computer science and NP-completeness · See more »

PSPACE

In computational complexity theory, PSPACE is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of space.

Computational complexity theory and PSPACE · List of important publications in theoretical computer science and PSPACE · See more »

Randomized algorithm

A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic.

Computational complexity theory and Randomized algorithm · List of important publications in theoretical computer science and Randomized algorithm · See more »

Richard M. Karp

Richard Manning Karp (born January 3, 1935) is an American computer scientist and computational theorist at the University of California, Berkeley.

Computational complexity theory and Richard M. Karp · List of important publications in theoretical computer science and Richard M. Karp · See more »

Theoretical computer science

Theoretical computer science, or TCS, is a subset of general computer science and mathematics that focuses on more mathematical topics of computing and includes the theory of computation.

Computational complexity theory and Theoretical computer science · List of important publications in theoretical computer science and Theoretical computer science · See more »

Travelling salesman problem

The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.

Computational complexity theory and Travelling salesman problem · List of important publications in theoretical computer science and Travelling salesman problem · See more »

Turing machine

A Turing machine is a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules.

Computational complexity theory and Turing machine · List of important publications in theoretical computer science and Turing machine · See more »