Theoretical Computer Science
Jan Johannsen
  • Munich, Germany
  • Member for 10 years, 1 month
Profile Activity
Stats
4,482
reputation
54k
reached
40
answers
6
questions
Communities
View all
About

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.

Badges
View all badges
2
gold badges
30
silver badges
50
bronze badges
Top tags
View all tags
232
Score
26
Posts
57
Posts %
127
Score
12
Posts
26
Posts %
73
Score
10
Posts
22
Posts %
57
Score
10
Posts
22
Posts %
55
Score
13
Posts
28
Posts %
40
Score
4
Posts
9
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
21
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
17
Theoretical explanations for practical success of SAT solvers?
Mar 31 '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
Golden ratio or Pi in the running time
Jan 8 '13
15
What are the compelling reasons for believing $L\neq P$?
Oct 9 '13
14
Syntactic Complexity Class ${\bf X}$ such that ${\bf PP} \subseteq {\bf X} \subseteq {\bf PSPACE}$
May 17 '13
Top network posts
View all network posts
42
Which (non-Earth) planet appears in the most Star Trek episodes?
14
Who was the candy man Riff Raff was expecting?
14
Proof Complexity of a Proof or Disproof of P = NP
10
Spinal Tap: Units confusion in building Stonehenge stage prop
9
Does rock + rap/hip-hop genre have a name?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.