Topics: Theoretical : Complexity Theory
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).
Conferences
Conferences, meetings, seminars, workshops etc. studying Complexity in Algorithms.
Past,
More »
Publications
Books, eprints, journals, magazines, newletters, preprints, etc on Algorithmic Complexity.
More »
Help build the largest human-edited directory on the web.