Communities (6)
- Theoretical Computer Science 3.4k 3.4k 1717 silver badges2424 bronze badges
- MathOverflow 3.3k 3.3k 11 gold badge1919 silver badges3535 bronze badges
- Mathematics 981 981 55 silver badges1212 bronze badges
- Academia 563 563 44 silver badges77 bronze badges
- MathOverflow 163 163 44 bronze badges
- View network profile
Top network posts
- 32 Finite automata that accept binary strings divisible by n
- 26 How to modify a final draft to reflect that a conjecture in its preprint was refuted?
- 16 Definition of matrix-multiplication exponent $\omega$
- 16 Is every busy beaver strictly monotonic asymptotically?
- 15 Under what circumstances do $O(n^{a + \epsilon})$ algorithms imply $O(n^{a+o(1)})$ algorithms?
- 13 Memory requirement for fast matrix multiplication
- 11 Is there a randomized complexity class analogous to $\mathsf{P/Poly}$?
- View more network posts →
Keeping a low profile.
This user hasn't posted yet.