Skip to main content
Theoretical Computer Science

Announcer

 Announcer
Share a link to a post later visited by 25 unique IP addresses. This badge can be awarded multiple times.

earned this badge 11 times.
Consequences of Factoring being in P?
Awarded Dec 12, 2019 at 22:40
Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively, the Axiom of Determinacy?)
Awarded Jul 10, 2018 at 10:29
Polynomial-time algorithms with huge exponent/constant
Awarded Sep 5, 2014 at 17:12
A square with entries whose adjacencies never repeat
Awarded Oct 31, 2013 at 10:21
List of TCS conferences and workshops
Awarded May 10, 2012 at 17:25
How many words of length $k$ on $l$ letters avoid a partial word?
Awarded Apr 10, 2012 at 12:42
Is {$a^{i}b^{j}c^{k} ~|~ i \neq j, i \neq k, j \neq k$} non-context-free?
Awarded Mar 10, 2012 at 12:28
Difference between theory and practice of security and cryptography?
Awarded Jan 10, 2012 at 12:38
Extended Church-Turing Thesis
Awarded Jan 10, 2012 at 12:38
More on PH in PP?
Awarded Jan 10, 2012 at 12:38
Does NP-hardness imply P-hardness?
Awarded Mar 19, 2011 at 10:12

Others with this badge