×
+ All Categories
Log in
English
Français
Español
Deutsch
The top documents tagged [proof idea]
Home >
proof idea
Communication requirements of VCG-like mechanisms in convex environments Ramesh Johari Stanford University Joint work with John N. Tsitsiklis, MIT.
217 views
The Complexity of Sampling Histories Scott Aaronson, UC Berkeley aaronson August 5, 2003.
227 views
A Theory of Isolatability Scott Aaronson Andrew Drucker MIT.
233 views
The Learnability of Quantum States Scott Aaronson University of Waterloo.
214 views
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 1 23 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Lower Bounds for Local Search by Quantum Arguments Scott Aaronson.
214 views
Quantum Double Feature Scott Aaronson (MIT) The Learnability of Quantum States Quantum Software Copy-Protection.
217 views
Quantum Information and the Brain Scott Aaronson (MIT) NIPS 2012, Lake Tahoe | ?
220 views
Balanced Search Trees Robert Tarjan, Princeton University & HP Labs (Joint work with Bernhard Haeupler and Siddhartha Sen)
213 views
The Mathematics Of 1950s Dating: Who wins the battle of the sexes? Great Theoretical Ideas In Computer Science Steven Rudich CS 15-251 Spring 2003 Lecture.
218 views
Yannis Smaragdakis / 11-Jun-14 General Adaptive Replacement Policies Yannis Smaragdakis Georgia Tech.
213 views
COMPLEXITY THEORY CSci 5403 LECTURE XVI: COUNTING PROBLEMS AND RANDOMIZED REDUCTIONS.
222 views
Non-Deterministic Finite Automata. HM2 samples 1. Question ID 74: Examine the following DFA: Identify in the list below the string that this automaton.
273 views
Next >