Computers » Computer Science » Theoretical » Complexity Theory	UPDATE INFO | REPORT BROKEN LINK
Busygin, Stas	Popularity:    Hit: 595

Details:

Efficient algorithms for hard computational problems; NP-completeness. Publications; software; resources on NP-completeness. URL: http://busygin.dp.ua/ Title: Image: Description: Computers, Computer Science, Theoretical, Complexity Theory - Busygin, Stas. Efficient algorithms for hard computational problems. Similar:

Related Sites

Kolmogorov, Aleksey (Popularity: ): Moscow State University. Ryabko, Boris (Popularity: ): Siberian State University. Shoup, Victor (Popularity: ): Courant Institute. IEEE Conference on Computational Complexity (Popularity: ): Permanent web site for the series (started as "Structure in Complexity Theory" in 1986) with charter, committee membership, current announcements ... Information-based Complexity (Popularity: ): People, publications, prizes. MCS at Argonne National Laboratory (Popularity: ): Description of past and present research using supercomputers, abstracts of publications, and links to software being developed at the lab.

Popular Sites

Information-based Complexity (Popularity: ): People, publications, prizes. IEEE Conference on Computational Complexity (Popularity: ): Permanent web site for the series (started as "Structure in Complexity Theory" in 1986) with charter, committee membership, current announcements ... Shoup, Victor (Popularity: ): Courant Institute. Busygin, Stas (Popularity: ): Efficient algorithms for hard computational problems; NP-completeness. Publications; software; resources on NP-completeness. Ryabko, Boris (Popularity: ): Siberian State University.

Related Articles

Workouts to Get Ready for Your Season (Popularity: ): I don't know about you, but I am about a month away from my season tryout for high school, and ...