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
Ari
top
accounts
reputation
activity
subscriptions
Top Questions
17
votes
Rabbi Samson Raphael Hirsch and Chassidism
history
chasidut-hasidism
samson-raphael-hirsch
asked Oct 5, 2018 at 16:00
judaism.stackexchange.com
14
votes
Why do Shaefer's and Mahaney's Theorems not imply P = NP?
complexity-theory
np-complete
satisfiability
p-vs-np
asked Jun 22, 2015 at 13:06
cs.stackexchange.com
14
votes
Is determining if there is a prime in an interval known to be in P or NP-complete?
complexity-theory
np
polynomial-time
primes
asked Aug 21, 2015 at 16:30
cs.stackexchange.com
13
votes
Conditions needed to prove $|A|^{|P(A)|}=|P(P(A))|$
set-theory
cardinals
axiom-of-choice
asked Mar 28 at 14:04
math.stackexchange.com
11
votes
Terminology for parts of limit notation
calculus
notation
terminology
limits
asked Feb 5, 2020 at 18:48
matheducators.stackexchange.com
10
votes
Complexity of finding an edge set yielding specified vertex degrees
cc.complexity-theory
graph-theory
graph-algorithms
np-hardness
asked Dec 11, 2019 at 15:46
cstheory.stackexchange.com
10
votes
Are NP-complete sets formed from two other sets only if at least one is NP-hard?
complexity-theory
np-hard
np
np-intermediate
asked Aug 24, 2015 at 15:49
cs.stackexchange.com
9
votes
P vs NP and the Time Hierarchy
complexity-theory
time-complexity
polynomial-time
p-vs-np
asked Jun 23, 2015 at 12:59
cs.stackexchange.com
9
votes
How does the use of oracle Turing machines not lead to contradictions?
complexity-theory
oracle-machines
asked Dec 7, 2014 at 0:04
cs.stackexchange.com
9
votes
Math Education for Students who use Right-to-Left Written Languages
mathematical-pedagogy
reference-request
education-research
english-language-learners
asked Jun 16, 2020 at 15:06
matheducators.stackexchange.com
1
2
3
next
Top Answers
6
Why doesn't Godel's Second Incompleteness Theorem rule out a formalizable proof of P!=NP?
cs.stackexchange.com
Stack Exchange works best with JavaScript enabled