Joshua Grochow

Boulder, CO

http://www.cs.colorado.edu/~jgrochow/

Assistant Professor in the Department of Computer Science and Department of Mathematics at the University of Colorado, Boulder

top accounts reputation activity subscriptions

Examples of the price of abstraction?

ds.algorithms reference-request big-list lower-bounds asked Aug 26, 2010 at 4:00

cstheory.stackexchange.com

85 votes

Funny TCS-related papers etc?

reference-request soft-question big-list asked Nov 18, 2010 at 3:07

cstheory.stackexchange.com

68 votes

Applications of TCS to classical mathematics?

reference-request big-list asked Aug 17, 2010 at 14:34

cstheory.stackexchange.com

59 votes

Theoretical explanations for practical success of SAT solvers?

cc.complexity-theory ds.algorithms sat big-picture heuristics asked Mar 30, 2017 at 21:02

cstheory.stackexchange.com

36 votes

Complexity of testing for a value versus computing a function

cc.complexity-theory reference-request algebraic-complexity asked Aug 17, 2010 at 5:17

cstheory.stackexchange.com

28 votes

Natural problems in $NP \cap coNP$ not in $UP \cap coUP$?

cc.complexity-theory complexity-classes np asked Aug 19, 2010 at 20:21

cstheory.stackexchange.com

26 votes

Is the cohomology ring of a finite group computable?

finite-groups computability-theory group-cohomology computational-group-theory asked May 9, 2018 at 2:48

mathoverflow.net

24 votes

What is known about the complexity of finding minimum circuits for SAT?

cc.complexity-theory sat asked Sep 20, 2010 at 17:25

cstheory.stackexchange.com

23 votes

Adding integers represented by their factorization is as hard as factoring? Reference request

cc.complexity-theory reference-request time-complexity factoring encoding asked Jul 23, 2011 at 16:33

cstheory.stackexchange.com

21 votes

Difference between theory and practice of security and cryptography?

cr.crypto-security asked Aug 24, 2010 at 15:21

cstheory.stackexchange.com

Top Answers

Funny TCS-related papers etc?

cstheory.stackexchange.com

Prerequisite for learning GCT

cstheory.stackexchange.com

Information Theory used to prove neat combinatorial statements?

cstheory.stackexchange.com

Funny TCS-related papers etc?

cstheory.stackexchange.com

Wikipedia-style explanation of Geometric Complexity Theory

cstheory.stackexchange.com

References for TCS proof techniques

cstheory.stackexchange.com

Is P equal to the intersection of all superpolynomial time classes?

cstheory.stackexchange.com

Where to learn more about what Theoretical Computer Science is?

cstheory.stackexchange.com

Hard-looking algorithmic problems made easy by theorems

cstheory.stackexchange.com

Problems Between P and NPC

cstheory.stackexchange.com

Provable statements about genetic algorithms

cstheory.stackexchange.com

Does Karp reducibility yield a total order?

cstheory.stackexchange.com

What are the compelling reasons for believing $L\neq P$?

cstheory.stackexchange.com

How difficult is it to use the Mulmuley-Sohoni GCT approach to show *known* complexity separations?

cstheory.stackexchange.com

Everyday encounters with NP-complete problems

cstheory.stackexchange.com

Algebra oriented branch of theoretical computer science

cstheory.stackexchange.com

EXPSPACE-complete problems

cstheory.stackexchange.com

Can it be determined if language L lies in NP?

cstheory.stackexchange.com

What would be the consequences of PH=PSPACE?

cstheory.stackexchange.com

Obituaries of dead conjectures

cstheory.stackexchange.com

Graph Isomorphism and hidden subgroups

cstheory.stackexchange.com

coNP certificate for Graph Isomorphism

cstheory.stackexchange.com

Examples of "Unrelated" Mathematics Playing a Fundamental Role in TCS?

cstheory.stackexchange.com

Mulmuley's GCT program

cstheory.stackexchange.com

Consequences of NP=PSPACE

cstheory.stackexchange.com

Example where equivalence is easy but finding class representative is hard

cstheory.stackexchange.com

Problems that started out with hopelessly intractable algorithms that have since been made extremely efficient

cstheory.stackexchange.com

Problem in BPP but not known to be in RP or co-RP

cstheory.stackexchange.com

Obituaries of dead conjectures

cstheory.stackexchange.com

For which algorithms is there a large gap between the theoretical analysis and reality?

cstheory.stackexchange.com