18.1k citations
- University of California, Santa BarbaraUS314 papers
- Microsoft Research (United Kingdom)GB248 papers
- Massachusetts Institute of TechnologyUS170 papers
- University of California, BerkeleyUS170 papers
- University of WashingtonUS165 papers
- Stanford UniversityUS156 papers
- Carnegie Mellon UniversityUS149 papers
- ETH ZurichCH131 papers
- Princeton UniversityUS119 papers
- University of Maryland, College ParkUS108 papers
- California Institute of TechnologyUS107 papers
- Cornell UniversityUS98 papers
Showing 1997Show all
2 papers · 1 filter
math.LO1997★ 3 cited
Choiceless polynomial time
Andreas Blass, Yuri Gurevich, Saharon Shelah
Turing machines define polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorph…
quant-ph1997★ 1.5k cited
Strengths and Weaknesses of Quantum Computing
Charles H. Bennett, Ethan Bernstein, Gilles Brassard +1
Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabilist…