In Partnership with AOL Search
 
The study of algorithmic complexity. A topic of particular interest is the relationship between polynomial-time (P) and non-deterministic polynomial-time (NP), the latter consisting of algorithms for which there is a P solution given the right initial guess (often called witness or certificate).
The conferences of Theoretical Computer Science.
Formal language theory is defined to be the study of sets of words over finite alphabets. In formal language theory a word in a language can be accepted by a device (automaton) or generated by a grammar. The four languages of the Chomsky hierarchy (regular, context free, context sensitive and recursively enumerable languages) are typically studied.
Online Forums and Networks discussing aspects of Theoretical Computer Science.
Important journals of theoretical computer science.
The people actively involved in research in theoretical computer science.
Please submit sites dealing with simulation of quantum computers, quantum programming languages and other software related to research in quantum information theory.
There is currently no description created for this category.
Academic Research Groups in Theoretical Computer Science.
Software related to theoretical computer science.
Copyright © 1998-2014 AOL Inc. Terms of Use
Last update: Thursday, May 28, 2009 1:18:27 PM EDT - edit