1. Tour
  2. About Us
  3. Meta
Loading…
  1. 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
  2. Log in

Stack Exchange

  • All Sites
  • Top Users
  • Digests

mdxn

https://mdxn.org

top accounts reputation activity subscriptions
Top Questions
15 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
13
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
  • About
  • Contact
  • Feedback
Company
  • Stack Overflow
  • Teams
  • Advertising
  • Collectives
  • Talent
  • Press
  • Legal
  • Privacy Policy
  • Terms of Service
  • Cookie Settings
  • Cookie Policy
Stack Exchange Network
  • Technology
  • Culture & recreation
  • Life & arts
  • Science
  • Professional
  • Business
  • API
  • Data
  • Blog
  • Facebook
  • Twitter
  • LinkedIn
  • Instagram

Site design / logo © 2023 Stack Exchange Inc; user contributions licensed under CC BY-SA. rev 2023.9.22.43641