Network profile

Jan Johannsen

Reputation

4,479

4.5k
4k
3.5k

2018
2019
2020
2021

Next tag badge

complexity-classes

127/100 score

12/20 answers

Badges

2

29

48

Newest

Steward

Next badge

106/500

Impact

106 posts edited

89 helpful flags

1,328 votes cast

4 Bookmarks

Votes Activity Newest Views Added

16

votes

2

answers

454

views

Publishing short and simple results

soft-question

Sep 11 at 20:47 Manu 7,359

9

votes

0

answers

138

views

Direct Proof that the Pigeonhole Principle is Hard for Regular Resolution

resolution

Oct 17 '18 at 19:07 corregular 91

47

votes

5

answers

2k

views

Theoretical explanations for practical success of SAT solvers?

cc.complexity-theory ds.algorithms sat heuristics

Jul 17 '17 at 0:54 Kaveh 21k

17

votes

0

answers

467

views

What if an $\mathsf L$-complete problem has $\mathsf{NC}^1$ circuits? More generally, what evidence is there against $\mathsf{NC}^1=\mathsf{L}$?

cc.complexity-theory complexity-classes circuit-complexity advice-and-nonuniformity logspace

Oct 22 '14 at 10:11 Damiano Mazza 4,308

Theoretical Computer Science Stack Exchange works best with JavaScript enabled