Tour
About Us
Meta
Loading…
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
Log in
Stack Exchange
All Sites
Top Users
Digests
mdxn
https://mdxn.org
top
accounts
reputation
activity
bookmarks
subscriptions
Top Questions
14
votes
Is There a Complete Problem for the Class of Turing Decidable Problems?
computability
reductions
turing-completeness
recursion-theory
asked Sep 20, 2014 at 19:48
cs.stackexchange.com
13
votes
Is the collapse of $PH$ known to extend downward to classes in-between its levels?
cc.complexity-theory
polynomial-hierarchy
asked Oct 8, 2013 at 1:51
cstheory.stackexchange.com
Top Answers
11
SAT not reducible to 2SAT
cs.stackexchange.com
11
How to reduce the number of crossing edges in a diagram?
cs.stackexchange.com
11
Complexity classes pertaining to listing all solutions?
cs.stackexchange.com
9
What is "polynomial delay?"
cs.stackexchange.com
9
How did each class of languages receive their name?
cs.stackexchange.com
5
A clarification on $PP$
cs.stackexchange.com
Stack Exchange works best with JavaScript enabled
cs.stackexchange.com
cstheory.stackexchange.com