Computer Science
user777's user avatar
user777's user avatar
user777's user avatar
user777
  • Member for 8 years, 6 months
  • Last seen more than a month ago
Profile Activity
Stats
729
reputation
11k
reached
1
answer
36
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
3
silver badges
20
bronze badges
Top tags
View all tags
2
Score
2
Posts
5
Posts %
0
Score
17
Posts
46
Posts %
0
Score
7
Posts
19
Posts %
0
Score
4
Posts
11
Posts %
0
Score
4
Posts
11
Posts %
0
Score
3
Posts
8
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
14
If $n^{\log n}$ is not polynomial or exponential, then what this function is called?
Oct 11, 2015
question
8
When did polynomial-time algorithm become of interest?
Jun 19, 2015
question
5
Why $\frac{n^3}{2^{\Omega(\sqrt{\log n})}}$ doesn't refute the lower bound $O(n^{3-\delta})$?
Apr 25, 2020
question
3
Why gap preserving reduction is weaker than L-reduction?
Feb 21, 2018
question
3
Show that $P^A \neq EXP^A$ for all oracles A
Jul 16, 2021
question
2
What does this mean $[X]_1^T$?
Sep 10, 2015
question
2
Why encoding of graph in adjacency matrix is $\Omega (\sqrt n)$?
Sep 26, 2017
question
2
What does it mean this relation: $BQP^{BQP} = BQP$
Nov 19, 2019
question
2
For all oracles A, If $P^A \neq PSPACE^A$, then Does it imply that $P \neq PSPACE$?
Jan 19, 2021
question
2
Why if for any computable function f(n) that is less than n, then Time Hierarchy Theorem wouldn't hold?
Apr 17, 2021
Top network posts
View all network posts
10
Resources to study quantum algorithms and quantum complexity
9
How to use Fitts’s Law?
7
Is quantum computer without entanglement no better than anything classically achievable?
5
CS conjecture that Quantum Computer cannot solve NP-complete problems, but Boson Samplers do a #P-hard problem. How is it?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.