Juan Bermejo Vega
  • Member for 10 years
  • Last seen more than 2 years ago
39 answers
151 votes
44k views
349 bookmarks
What videos should everybody watch?
5 answers
101 votes
22k views
95 bookmarks
List of TCS conferences and workshops
2 answers
86 votes
31k views
45 bookmarks
What is the actual time complexity of Gaussian elimination?
2 answers
85 votes
11k views
20 bookmarks
Was the reduction in Shor's algorithm originally discovered by Shor?
42 answers
82 votes
17k views
74 bookmarks
Funny TCS-related papers etc?
13 answers
69 votes
8k views
52 bookmarks
Common false beliefs in theoretical computer science
8 answers
39 votes
2k views
8 bookmarks
Formal notion for energy complexity of computational problems
6 answers
39 votes
6k views
16 bookmarks
Regular expressions aren't
8 answers
35 votes
3k views
13 bookmarks
Which definition of asymptotic growth-rate should we teach?
7 answers
32 votes
10k views
25 bookmarks
Should we consider $\mathsf{P} \neq \mathsf{NP}$ a law of nature?
4 answers
27 votes
1k views
5 bookmarks
Quantum approximation algorithms
2 answers
26 votes
843 views
10 bookmarks
What is the complexity of distinguishing a true Fourier spectra from a fake one?
3 answers
24 votes
906 views
10 bookmarks
Can we quantify the "degree of quantumness" in a quantum algorithm ?
1 answers
23 votes
577 views
4 bookmarks
The randomized query complexity of the conjoined trees problem
5 answers
23 votes
7k views
13 bookmarks
Is there any connection between the diamond norm and the distance of the associated states?
1 answers
23 votes
1k views
4 bookmarks
Is the 2016 implementation of Shor's algorithm really scalable?
2 answers
21 votes
935 views
5 bookmarks
What is the big version of NC?
1 answers
20 votes
670 views
4 bookmarks
Does cryptography have an inherent thermodynamic cost?
4 answers
20 votes
750 views
6 bookmarks
Is there an equivalent to derandomization for quantum algorithms?
1 answers
20 votes
3k views
8 bookmarks
Solving semidefinite programs in polynomial time
2 answers
20 votes
636 views
5 bookmarks
Bounded depth probability distributions
1 answers
19 votes
994 views
4 bookmarks
Why does Odlyzko improvement of Shor's Algorithm reduces the number of trials to $O(1)$
2 answers
18 votes
902 views
6 bookmarks
Status on circuit lower bounds for polylog-bounded depth circuits
2 answers
18 votes
219 views
1 bookmarks
Temporally Flat One-Way Quantum Computing
1 answers
17 votes
866 views
5 bookmarks
Reading up on $BQP = BPP^{BQNC}$
1 answers
17 votes
360 views
2 bookmarks
Which results make quantum space interesting?
1 answers
17 votes
370 views
4 bookmarks
Geometric picture behind quantum expanders
5 answers
17 votes
3k views
5 bookmarks
Real world applications of quantum computing (except for security)
1 answers
16 votes
1k views
5 bookmarks
Solving a linear diophantine equation approximately
1 answers
16 votes
442 views
3 bookmarks
Oracular separations between poly- and log-depth quantum circuits