| |
 |
Category List - Main » Computers » Computer Science » Theoretical |
 |
|
New Sites - Main » Computers » Computer Science » Theoretical » Complexity Theory |
|
|
Busygin, Stas (27th April, 2005) : Efficient algorithms for hard computational problems; NP-completeness. Publications; software; resources on NP-completeness. |
|
Shoup, Victor (27th April, 2005) : Courant Institute. |
|
Ryabko, Boris (27th April, 2005) : Siberian State University. |
|
Kolmogorov, Aleksey (27th April, 2005) : Moscow State University. |
|
IEEE Conference on Computational Complexity (27th April, 2005) : Permanent web site for the series (started as "Structure in Complexity Theory" in 1986) with charter, committee membership, current announcements and archives. |
|
Top Sites - Main » Computers » Computer Science » Theoretical » Complexity Theory |
|
|
|
)