Badge
| Nice Answer | Answer score of 10 or more. This badge can be awarded multiple times. |
Yuval Filmus earned this badge 19 times |
feb 15 at 12:33
Smallest known formula for the determinant
feb 4 at 21:33
Are there any problems whose best known algorithm has run time $O\left(\frac{f(n)}{\log n}\right)$
jan 4 at 20:10
The Cost of an Equivalence Query for DFA
dec 31 at 21:43
(post deleted or otherwise unavailable)
dec 24 at 20:16
The cozy neighborhoods of “P” and of “NP-hard”
nov 30 at 14:53
Reasons for which a graph may be not $k$ colorable?
oct 1 at 8:05
Are all the functions whose fourier weight is concentrated on the small sized sets computed by AC0 circuits?
sep 21 at 10:33
Who introduced the complexity class AC?
jul 20 at 16:31
Efficient universal problem solver?
jul 8 at 19:59
The computational complexity of matrix multiplication
mar 14 '12 at 21:10
Results in Theoretical CS independent of ZFC
feb 26 '12 at 22:20
Do there exists polynomial size CFG that describe this finite language?
may 25 '11 at 9:38
What is the most efficient way to generate a random permutation from probabilistic pairwise swaps?
jan 18 '11 at 21:53
A special class of languages: “circular” languages. Is it known?
jan 16 '11 at 1:05
Post Correspondence Problem variant
oct 7 '10 at 4:51
Is $AC^0/poly \cap NP$ contained in $P$?
