Badge

 Good Question Question score of 25 or more. This badge can be awarded multiple times.

This badge has been awarded 196 times. Recently awarded to:
may 15 at 0:44
Prerequisite for learning GCT — syucha 12613
may 8 at 16:41
Efficient and simple randomized algorithms where determinism is difficult — adrianN 397211
may 1 at 12:58
What are the reasons that researchers in computational geometry prefer the BSS/real-RAM model? — Kaveh♦ 9,358232111
apr 10 at 12:17
Correspondence between complexity classes and logic — ripper234 375413
apr 5 at 18:21
How difficult is it to use the Mulmuley-Sohoni GCT approach to show *known* complexity separations? — Mugizi Rwebangira 968516
mar 30 at 20:20
Quantum matrix multiplication? — Henry Yuen 1,451621
mar 21 at 12:35
Can one return to a TCS research job after an excursion to a non-research industry job? — Holger 56859
mar 16 at 13:12
Mulmuley's GCT program — Anonymous 890213
mar 9 at 10:15
NP-hard problems on trees — Shiva Kintali 5,4591558
mar 4 at 11:51
How do 'tactics' work in proof assistants? — John Salvatier 38029
mar 4 at 11:01
How do I get started in theoretical CS ? — Good Person 19617
mar 3 at 21:46
Shallow versus Deep Embeddings — Dave Clarke♦ 12.3k23589
mar 3 at 19:26
Formal notion for energy complexity of computational problems — Mohammad Al-Turkistany 5,24521048
feb 26 at 22:29
NP-Completeness of the decision problem for the generalized 15-puzzle — Listing 15117
feb 23 at 23:46
How do the state-of-the-art pathfinding algorithms for changing graphs (D*, D*-Lite, LPA*, etc) differ? — BlueRaja - Danny Pflughoeft 6771514
feb 21 at 23:29
A Notion of Monotone Quantum Circuits — Gil Kalai 2,2761336
feb 20 at 4:15
Toy examples for barriers to $P \ne NP$ — v s 933312
feb 19 at 23:25
What is the minimum number of bits required to store a sudoku puzzle? — nightcracker 22624
feb 16 at 0:08
What hierarchies and/or hierarchy theorems do you know? — chazisop 1,544922
feb 16 at 0:08
Optimal greedy algorithms for NP-hard problems — Shiva Kintali 5,4591558
jan 29 at 5:54
What are the consequences of $\mathsf{L}^2 \subseteq \mathsf{P}$? — argentpepper 664318
jan 24 at 20:08
How did TCS become conference-oriented rather than journal-oriented? — Ohad Kammar 1,386719
jan 21 at 20:25
Problem unsolvable in $2^{o(n)}$ on inputs with $n$ bits, assuming ETH? — Michael Lampis 45959
jan 16 at 3:34
Is $AC^0/poly \cap NP$ contained in $P$? — Kaveh♦ 9,358232111
jan 10 at 20:26
Ladner's Theorem vs. Schaefer's Theorem — user834 1,427621
jan 6 at 16:06
Tight Lower bounds on Savitch's theorem — gabgoh 706313
jan 4 at 18:15
What is the complexity of distinguishing a true Fourier spectra from a fake one? — Mirmojtaba Gharibi 12613
jan 3 at 21:40
References for TCS proof techniques — Kurt 494613
jan 1 at 20:19
Is there a stable heap? — JɛffE 13.9k253128
dec 28 at 18:24
Hardness of approximation without the PCP theorem — Andras Farago 36117
dec 26 at 6:47
The cozy neighborhoods of “P” and of “NP-hard” — Gil Kalai 2,2761336
dec 26 at 0:27
Are there “small” machines which can efficiently match regular expressions? — Neel Krishnaswami 14k3189
dec 24 at 1:26
What is the enlightenment I'm supposed to attain after studying finite automata? — PhD 733349
dec 21 at 18:55
What constitutes denotational semantics? — Ohad Kammar 1,386719
dec 4 at 4:39
Does LOGLOG = NLOGLOG? — domotorp 3,133831
nov 25 at 18:30
Is $PH \subseteq PP$? — Huck Bennett 1,74821228
nov 19 at 23:38
Toy Examples for Plotkin-Shmoys-Tardos and Arora-Kale solvers — Luca Trevisan 3,3191429
oct 29 at 0:49
Approximation algorithms for Metric TSP — Alex Golovnev 863715
oct 21 at 2:45
Cohomological approach to boolean complexity — Marcin Kotowski 1,513518
oct 15 at 22:26
Good examples for how to write well in TCS — Suresh Venkat♦ 19.5k252190
oct 8 at 6:21
Monotone complexity of s-t connectivity — Stasys 1,953822
sep 26 at 5:06
Curry-Howard and programs from non-constructive proofs — Kaveh♦ 9,358232111
sep 25 at 17:11
Fourier coefficients Boolean Functions described by Bounded Depth Circuits with AND OR and XOR gates — Gil Kalai 2,2761336
sep 25 at 11:06
Applications of representation theory of the symmetric group — Sasho Nikolov 5,2812041
sep 22 at 20:29
Why does Fourier analysis of Boolean functions “work”? — Tom Gur 830623
sep 22 at 12:14
Polynomial-time algorithms with huge exponent/constant — Joris 16717
sep 18 at 18:51
What do we know about provably correct programs? — Alex ten Brink 1,937729
sep 8 at 0:26
Drunken birds vs drunken ants: random walks between two and three dimensions — Suresh Venkat♦ 19.5k252190
sep 4 at 11:19
Uses of algebraic structures in theoretical computer science — lewellen 23836
aug 27 at 4:14
Commonest Subsequence — daveagp 667311
aug 22 at 21:01
Inductive types for large countable ordinal notations. — Russell O'Connor 22623
aug 16 at 21:47
Historical reasons for adoption of Turing Machine as primary model of computation. — Evan Hanson 23324
aug 14 at 5:44
How hard is it to count the number of factors of an integer? — Artem Kaznatcheev 4,73611369
aug 1 at 0:03
Are there non-constructive algorithm existence proofs? — jkff 2,0183820
jul 31 at 18:43
Is there a backup/replacement for the Complexity Zoo? — Martin Schwarz 3,3371026
jul 28 at 20:27
Current parallel models for computation — Nicholas Mancuso 482512
jul 8 at 2:08
Why have we not been able to develop a unified complexity theory of distributed computing? — Srikanth Sastry 19518
jun 27 '12 at 1:46
Conjectures implying Four Color Theorem — Shiva Kintali 5,4591558
jun 12 '12 at 18:17
Higher-order algorithms — jkff 2,0183820
jun 12 '12 at 15:07
Journals with quick reviewing — Jukka Suomela 6,83422885
1 2 3 4