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
Mohsen Ghorbani
top
accounts
reputation
activity
bookmarks
subscriptions
Top Questions
7
votes
Why should we believe that $NEXP \not \subset P/poly$
circuit-complexity
derandomization
nexp
asked Jan 18, 2021 at 7:57
cstheory.stackexchange.com
6
votes
Can we use quantum machines to reduce space complexity of deterministic turing machines?
complexity-theory
memory-space
space-complexity
asked Oct 21, 2018 at 18:14
quantumcomputing.stackexchange.com
6
votes
Does finding a cycle with $\log n$ length in $\text{P}$?
algorithms
complexity-theory
graphs
lower-bounds
asked Nov 7, 2018 at 11:03
cs.stackexchange.com
Top Answers
5
SAT satisfaction with 10 variables
cs.stackexchange.com
Stack Exchange works best with JavaScript enabled