4:50 PM
21
I wonder, what is (currently) the largest number $k$, such that a natural problem is known with the following properties: An $O(n^k)$ algorithm has been already found for the problem. For any fixed $\epsilon>0$ no $O(n^{k-\epsilon})$ algorithm is known for the same problem. (Note that a faster ...
4 hours later…
8:24 PM
Programming Puzzles & Code Golf tcs.se community ad approved yesterday after online chat campaign! way cool. 1st ever maybe?
a very promising site as far as raw talent. some participants seem to be very advanced. some talented at young age. crowd is very populist and votes a lot. good teamwork. very active chat room. site seems to have untapped possibilities for crosspollination with cs.se/tcs.se sites.
in Computer Science, 5 hours ago, by vzn
algorithm math primes kolmogorov-complexity combinatorics regular-expression number-theory optimization cryptography compression graphs logic-gates fractal data-structures busy-beaver cellular-automata game-of-life ...
« first day (283 days earlier) ← previous day next day → last day (3346 days later) »
Transcript for
Apr1
Apr '148
Apr13
theory salon
theoretical computer science. highlight reel vzn1.wordpress.co...