|
Top > Computers > Computer Science > Theoretical > Complexity Theory > People
See also:

|
» Complexity People - A list of researchers, maintained by the Electronic Colloquium on Computational Complexity.
|

|
» Alon, Noga - School of Mathematical Sciences at Tel Aviv University.
|

|
» Bläser, Markus - Saarland University, Department of Computer Science
|

|
» Busygin, Stas - Efficient algorithms for hard computational problems; NP-completeness. Publications; software; resources on NP-completeness.
|

|
» Franco, John - Probabilistic analysis of algorithms, polynomial time solvable subclasses of satisfiability.
|

|
» Frisch, Alan - Artificial Intelligence, constraint satisfaction problems
|

|
» Hermann, Miki - National Center for Scientific Research (France).
|

|
» Krajicek, Jan - Mathematical Institute of the Academy of Sciences of the Czech Republic.
|

|
» Meinel, Christoph - Hasso Plattner Institute for Software Systems Engineering, University of Potsdam
|

|
» Papadimitriou, Christos H. - Author of the very popular book on complexity theory. Home page with recent publications and links to courses.
|

|
» Parberry, Ian - Department of Computer Science and Engineering, University of North Texas.
|

|
» Per Bjesse - SAT-based hardware verification (using Stalmarck's algorithm)
|

|
» Pudlák, Pavel - Mathematical Institute of the Academyof Sciences of the Czech Republic.
|

|
» Raz, Ran - Weizmann Institute of Science.
|

|
» Sgall, Jiri - Mathematical Institute, Academy of Sciences of the Czech Republic.
|

|
» Vardi, Moshe Y. - Recent paper on the hardness of random formulas for SAT solver; bounded tree-width.
|

|
» Xu, Ke - Beijing University of Aeronautics and Astronautics.
|
The content of this directory is based on the Open Directory and may have been modified by clixShare
|