Stack Exchange

rank

top accounts reputation activity favorites subscriptions
2444
4620 votes
11 answers

Why is processing a sorted array faster than an unsorted array?

c++ performance optimization language-agnostic branch-prediction 2 days ago AlexK
stackoverflow.com

29
74 votes
15 answers

Examples of the price of abstraction?

ds.algorithms reference-request big-list lower-bounds Apr 13 at 19:27 Community
cstheory.stackexchange.com

23
48 votes
7 answers

How to shoot down your proofs

soft-question research-practice writing Nov 3 '11 at 11:58 Sid
cstheory.stackexchange.com

15
40 votes
8 answers

Are the “proofs by contradiction” weaker than other proofs?

logic proof-theory Oct 18 '12 at 16:54 user126
math.stackexchange.com

16
39 votes
7 answers

Could I be using proof by contradiction too much?

proof-writing contradiction Mar 7 at 20:49 Joseph
math.stackexchange.com

18
31 votes
8 answers

Higher-order algorithms

ds.algorithms functional-programming ds.data-structures pl.programming-languages Jun 12 '12 at 12:32 Jon Harrop
cstheory.stackexchange.com

7
27 votes
10 answers

Gröbner bases in TCS?

cc.complexity-theory reference-request algebra polynomials Sep 15 '11 at 3:41 Joshua Herman
cstheory.stackexchange.com

10
23 votes
5 answers

Programming languages for efficient computation

cc.complexity-theory computability pl.programming-languages Dec 12 '12 at 18:53 none
cstheory.stackexchange.com

3
14 votes
1 answer

Predicate Logic in Haskell

haskell data-structures context-free-grammar first-order-logic Feb 4 at 20:21 Lukasz Siemiradzki
stackoverflow.com

7
13 votes
7 answers

Pointers for CS applications of logic

lo.logic soft-question big-list books formal-methods Jan 18 at 4:23 Vijay D
cstheory.stackexchange.com

8
10 votes
5 answers

Which models of computation can be expressed through grammars?

fl.formal-languages pl.programming-languages grammars universal-computation May 25 '11 at 11:12 Vag
cstheory.stackexchange.com

2
9 votes
5 answers

What does it mean for something to be true but not provable in peano arithmetic?

logic incompleteness Oct 14 '12 at 7:16 Martin Sleziak
math.stackexchange.com

2
6 votes
5 answers

What is the fastest growing total computable function you can describe in a few lines?

number-theory computability Mar 11 at 10:49 Ikosarakt
math.stackexchange.com

2
6 votes
1 answer

What is the proof of the “thin set theorem”? A result in infinite Ramsey theory.

combinatorics ramsey-theory Jul 10 '12 at 17:41 Kevin Buzzard
math.stackexchange.com

3
6 votes
1 answer

Literature around NP vs EXPTIME

cc.complexity-theory complexity-classes May 11 '11 at 23:09 Marzio De Biasi
cstheory.stackexchange.com