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, meetings, seminars, workshops etc. studying Complexity in Algorithms.
Please submit sites with lasting value such as proceedings, reports, photographs, etc.
Books, eprints, journals, magazines, newsletters, preprints, etc on Algorithmic Complexity.