Kaveh

Toronto, Canada

PhD student at University of Toronto, Department of Computer Science, Theory Group.

Moderator on cstheory.

top accounts reputation activity favorites subscriptions

Advice on good research practices

soft-question research-practice advice-request asked Nov 13 '10 at 10:03

cstheory.stackexchange.com

37 votes

The importance of Integrality Gap

cc.complexity-theory ds.algorithms linear-programming approximation-algorithms asked Aug 22 '10 at 18:51

cstheory.stackexchange.com

26 votes

Is $AC^0/poly \cap NP$ contained in $P$?

cc.complexity-theory circuit-complexity uniformity asked Oct 6 '10 at 17:49

cstheory.stackexchange.com

26 votes

What are the reasons that researchers in computational geometry prefer the BSS/real-RAM model?

cc.complexity-theory cg.comp-geom computing-over-reals computable-analysis asked Oct 11 '10 at 23:16

cstheory.stackexchange.com

26 votes

Curry-Howard and programs from non-constructive proofs

lo.logic pl.programming-languages proof-theory asked Mar 2 '11 at 10:45

cstheory.stackexchange.com

24 votes

Is there a candidate for a natural problem in $P/poly - P$?

cc.complexity-theory uniformity asked Sep 25 '10 at 6:50

cstheory.stackexchange.com

22 votes

Consequences of $\mathsf{NP}$ containing $\mathsf{BPP}$

cc.complexity-theory randomness randomized-algorithms nondeterminism barriers asked Jan 7 at 6:24

cstheory.stackexchange.com

21 votes

Handbook of advanced data structures

soft-question ds.data-structures survey books asked Oct 4 '12 at 4:28

cstheory.stackexchange.com

21 votes

Explaining the relevance of asymptotic complexity of algorithms to practice of designing algorithms

algorithms complexity-theory education asked Sep 13 '12 at 1:02

cs.stackexchange.com

20 votes

Does $\mathsf{P/poly}$ have subexponential-size bounded-depth circuits?

cc.complexity-theory circuit-complexity subexponential bounded-depth asked Oct 27 '11 at 15:29

cstheory.stackexchange.com

Top Answers

Major unsolved problems in theoretical computer science?

cstheory.stackexchange.com

Major unsolved problems in theoretical computer science?

cstheory.stackexchange.com

In basic terms, what is the definition of P, NP, NP-Complete, and NP-Hard?

cs.stackexchange.com

Historical reasons for adoption of Turing Machine as primary model of computation.

cstheory.stackexchange.com

Why doesn't P=NP imply P=AP (i.e. P=PSPACE)?

cstheory.stackexchange.com

How can a problem be in NP, be NP-hard and not NP-complete?

cstheory.stackexchange.com

Is $AC^0$ with bounded fanout weaker than $AC^0$?

cstheory.stackexchange.com

Are there subexponential-time algorithms for NP-complete problems?

cs.stackexchange.com

Funny TCS-related papers etc?

cstheory.stackexchange.com

Axioms necessary for theoretical computer science

cstheory.stackexchange.com

Open problems on the frontiers of TCS

cstheory.stackexchange.com

Why are NPI problems not all of the same complexity?

cstheory.stackexchange.com

What videos should everybody watch?

cstheory.stackexchange.com

Are there any applications of techniques in real analysis to theoretical computer science?

cstheory.stackexchange.com

Algorithms from the Book.

cstheory.stackexchange.com

Church's Theorem and Gödel's Incompleteness Theorems

cstheory.stackexchange.com

Inspirational talk for final year high school pupils

cstheory.stackexchange.com

If P=NP, could we obtain proofs of Goldbach's Conjecture etc.?

cstheory.stackexchange.com

Why has hypercomputation research died down?

cstheory.stackexchange.com

Knapsack problem — NP-complete despite dynamic programming solution?

cs.stackexchange.com

Sub language is not Turing-recognizable, or could it be?

cs.stackexchange.com

Surprising Results in Complexity (Not on the Complexity Blog List)

cstheory.stackexchange.com

What do we know about provably correct programs?

cstheory.stackexchange.com

How to prove the mathematical induction is true?

math.stackexchange.com

What does 786 mean?

islam.stackexchange.com

Why does Shi'a Islam differ so much regarding Abu Bakr, Omar and Othman, compared to Sunni teachings?

islam.stackexchange.com

Which definition of asymptotic growth-rate should we teach?

cstheory.stackexchange.com

Funny TCS-related papers etc?

cstheory.stackexchange.com

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

cstheory.stackexchange.com

The motivation for using Karp-reductions in the theory of $\mathcal{NP}$-completeness

cstheory.stackexchange.com