Skip to main content

Stack Exchange

delete000

top accounts reputation activity subscriptions
Top Questions
12 votes

Fast classical simulation of quantum algorithms

cc.complexity-theory quantum-computing quantum-information asked Sep 10, 2018 at 14:46
cstheory.stackexchange.com

8 votes

How to benchmark #2-SAT counting algorithms?

reference-request sat counting-complexity random-k-sat asked Oct 6, 2017 at 18:21
cstheory.stackexchange.com

7 votes

Implementation of Lanczos method that returns tridiagonal matrix

linear-algebra python iterative-method eigensystem krylov-method asked Aug 29, 2019 at 19:39
scicomp.stackexchange.com

6 votes

Bounds on degrees of minors obtained by edge contractions of regular graphs

co.combinatorics graph-theory random-graphs graph-minors asked Jan 29, 2018 at 21:14
mathoverflow.net

6 votes

Counting on grid graphs

cc.complexity-theory complexity-classes counting-complexity asked Aug 7, 2020 at 21:40
cstheory.stackexchange.com

6 votes

Complexity of bounded degree full contraction

cc.complexity-theory graph-theory graph-algorithms np-hardness graph-minor asked Mar 15, 2018 at 23:38
cstheory.stackexchange.com

6 votes

How to prepare academically-minded students and postdocs for the eventuality of not finding secure academic employment?

career-path academic-life early-career mentoring asked Apr 13, 2019 at 20:00
academia.stackexchange.com

5 votes

Polyominoes with the most reflex exterior angles

combinatorics extremal-combinatorics polyomino asked May 17, 2018 at 17:30
math.stackexchange.com

5 votes

Hashing-based vs almost uniform sampling-based approximate counting

approximation-algorithms counting-complexity randomized-algorithms approximation-hardness asked Dec 23, 2021 at 16:17
cstheory.stackexchange.com

5 votes

Efficient way to generate random planar cubic bipartite graphs

cc.complexity-theory graph-theory graph-algorithms planar-graphs bipartite-graphs asked Jan 28, 2018 at 15:41
cstheory.stackexchange.com

1 2

Top Answers