Tour
About Us
Meta
Loading…
Log in
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Stack Exchange
All Sites
Top Users
Digests
Mikhail Rudoy
MIT class of 2016.
top
accounts
reputation
activity
bookmarks
subscriptions
Top Questions
9
votes
Class of languages recognizable by single-tape 3-state TMs
automata-theory
turing-machines
cellular-automata
asked Aug 1 '17 at 1:06
cstheory.stackexchange.com
Top Answers
15
Is optimally solving the n×n×n Rubik's Cube NP-hard?
cstheory.stackexchange.com
14
Example of logarithmic length witness being easier to verify than find
cstheory.stackexchange.com
11
Is $\sf{P^{NP \cap coNP}} = \sf{NP \cap coNP}$?
cstheory.stackexchange.com
10
Is this vertex ordering optimization NP-Hard?
cstheory.stackexchange.com
10
Are space and time hierarchies even comparable?
cstheory.stackexchange.com
8
Solving linear equations involving min
cstheory.stackexchange.com
8
Merging Graph Edges to form a 2 color-able Graph (with weight constraints)?
cstheory.stackexchange.com
8
totally-mixed 2SAT with exact cardinality?
cstheory.stackexchange.com
7
Is deciding whether all satisfying assignments are NAE assignments coNP-complete?
cstheory.stackexchange.com
7
Testing whether letters can be scheduled to achieve a word in a regular language
cstheory.stackexchange.com
7
Does a given regular language contain an infinite prefix-free subset?
cstheory.stackexchange.com
5
Running multiple rounds of a BQP computation, without multiple measurements?
cstheory.stackexchange.com
5
how to achieve a topological sort of an given sequence with minimum swaps
cstheory.stackexchange.com
5
A partition problem in which some numbers may be cut
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com