MathOverflow
user avatar
user avatar
user avatar
Robin Kothari
  • Member for 11 years, 10 months
  • Last seen more than a month ago
Profile Activity
Stats
1,272
reputation
24k
reached
13
answers
3
questions
Communities
View all
About

I am a theoretical computer scientist. My research interests include quantum algorithms and complexity theory.

Badges
View all badges
This user doesn’t have any gold badges yet.
9
silver badges
15
bronze badges
Top tags
View all tags
60
Score
7
Posts
44
Posts %
27
Score
5
Posts
31
Posts %
22
Score
3
Posts
19
Posts %
18
Score
2
Posts
12
Posts %
16
Score
3
Posts
19
Posts %
13
Score
4
Posts
25
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
17
Can knowing ahead the length of 3-SAT instance really help?
Aug 29, 2010
question
15
When does graph minor containment imply subgraph containment?
Jul 31, 2010
answer
15
Is there a syntactic characterization for BPP, BQP, or QMA?
Aug 12, 2010
answer
9
Enumeration and random selection
Aug 26, 2010
answer
9
What are some good examples of non-monotone graph properties?
Sep 28, 2010
answer
8
How much does a quantum oracle to find a needle in a haystack really cost?
Aug 9, 2012
answer
7
What is the easiest randomized algorithm to motivate to the layperson?
Sep 9, 2010
question
5
Ref request: A graph G contains H as a minor iff it contains one of finitely many graphs as a topological minor
Aug 30, 2010
answer
5
Amplitude amplification as a quantum walk algorithm
Oct 6, 2010
answer
5
Practical use of probability amplification for randomized algorithms
Aug 10, 2010
Top network posts
View all network posts
65
Problems that can be used to show polynomial-time hardness results
61
Open problems on the frontiers of TCS
52
What papers should everyone read?
43
Subscripts for primed variables
38
Do any quantum algorithms improve on classical SAT?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.