Theoretical Computer Science
Meta user
Network profile
3,974
reputation
1
27
47

Jan Johannsen

TCS researcher at LMU Munich. I am interested in computational complexity and logic, especially where the two intersect. My main field of work is propositional proof complexity.

40
answers
5
questions
~44k
people reached
  • Munich, Germany
  • Member for 7 years, 11 months
  • 511 profile views
  • Last seen Aug 17 at 21:52

Communities (7)

Top network posts

Top tags (45)

Score 229
Posts 26
Posts % 58
Score 127
Posts 12
Score 70
Posts 10
Score 57
Posts 10
Score 55
Posts 12
Score 40
Posts 4
View all tags →

Top posts (45) All Questions Answers | Votes Newest

20 Minimum True Monotone 3SAT Nov 23 '11
19 Has there been any research on $k$-SAT above the satisfiability threshold? Apr 9 '14
18 Uses of XORification Nov 16 '11
17 Entscheidungsproblem vs. Unvollständigkeitssatz (soft question) Mar 1 '17
16 $\mathsf{FP}^{\mathsf{NP}[\log n]}$ versus $\mathsf{FP}^{\mathsf{NP}||}$ Oct 14 '11
15 What is an equivalent definition of mP/poly in terms of a Turing machine? Jun 18 '15
15 What are the compelling reasons for believing $L\neq P$? Oct 9 '13
15 Golden ratio or Pi in the running time Jan 8 '13
15 Theoretical explanations for practical success of SAT solvers? Mar 31 '17
14 Syntactic Complexity Class ${\bf X}$ such that ${\bf PP} \subseteq {\bf X} \subseteq {\bf PSPACE}$ May 17 '13
View all questions and answers →

Badges (75)

Gold

1

Rarest

Silver

27

Rarest

Bronze

47

Rarest

View all badges →