Badge
| Nice Question | Question score of 10 or more. This badge can be awarded multiple times. |
Gil Kalai earned this badge 12 times |
apr 30 at 22:29
The complexity of sampling (approximately) the Fourier transform of a Boolean function
jan 25 at 14:49
Complexity of factoring in number fields
dec 23 at 19:40
The cozy neighborhoods of “P” and of “NP-hard”
dec 12 at 13:22
Triangulating a Planar Polygon
dec 5 at 18:04
Bounded depth probability distributions
sep 11 at 15:21
A Notion of Monotone Quantum Circuits
jun 15 '12 at 21:38
A lottery that you can be convinced that it is fair
aug 20 '11 at 2:57
How Hard is Exact Simulation of Algorithms, and a Related Operation on Complexity Classes
dec 16 '10 at 15:02
Approximately sampling from convex polyhedrons with quantum computers
nov 28 '10 at 13:50
Fourier coefficients Boolean Functions described by Bounded Depth Circuits with AND OR and XOR gates
nov 2 '10 at 5:07
Stronger notions of uniformizations?
sep 30 '10 at 17:01
A combinatorial version for the polynomial Hirsch conjecture
