Evanston / Austin / Princeton / Haifa / Cambridge / Amsterdam / College Park / Burnaby / /
Company
CNF / Russell / Case / Algebra 09421 / /
Country
Sudan / United States / / /
Facility
Kazan State University / Northwestern University / NW University / Simon Fraser University / University of Toronto / University of Texas / University of Maryland / University of Wyoming / Schloss Dagstuhl Leibniz Center / /
IndustryTerm
direct product / polynomial-time algorithm / bank / constant rst polynomial-time algorithms / convergence law / non-trivial solutions / quantum computing / /
Organization
University of Texas at Austin / University of Maryland / MIT / Northwestern University / Institute for Advanced Study / NW University / Hochschule Aalen / Univ. of Texas / Kazan State University / Schloss Dagstuhl Leibniz Center for Informatics / University of Wyoming / University of Toronto / Simon Fraser University / Technion / /
Person
Manindra Agrawal / Christopher Umans / Lance Fortnow / Arkadev Chattopadhyay / Ragesh Jaiswal / Santhanam / Ai / Zeev Dvir / Christopher Umans Bounding Rationality / Eli Ben-Sasson / William Gasarch / Avi Wigderson / Robin Moser / David Garcia-Soriano / Christopher Umans Random Graphs / Valentine Kabanets / Stephen Wiesner / Robin Mosers / Thomas Thierauf / Computational Complexity / Avi Impagliazzo / John Hitchcock / Anna Gal / Thomas Thierauf Umans / Rahul On / Andrew Mills / /
Position
Mistake-Bound model / General / Executive / /
ProvinceOrState
Texas / Wyoming / Maryland / /
Technology
constant rst polynomial-time algorithms / deterministic / polynomial-time algorithm / cryptography / Avi / dom / /
09421 Abstracts Collection Algebraic Methods in Computational Complexity Dagstuhl Seminar 1