We’re rewarding the question askers & reputations are being recalculated! Read more.

Profile Activity

Jan Johannsen

Network profile

Reputation

4,344

4.3k
3.7k
3k

2016
2017
2018
2019

Next tag badge

complexity-classes

127/100 score

12/20 answers

Badges

1

28

47

Newest

Yearling

Next badge

99/500

Impact

99 posts edited

88 helpful flags

1,285 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

6 Questions

Views Newest Activity Votes

6

18

votes

2

answers

440

views

Uses of XORification

cc.complexity-theory reference-request boolean-functions proof-complexity

Nov 16 '11 at 23:53 Ryan Williams 24.3k

3

13

votes

2

answers

327

views

Natural complete problems in higher levels of the $\mathsf{W}$-hierarchy

cc.complexity-theory parameterized-complexity

Sep 19 '14 at 8:13 Marzio De Biasi 20.8k

2

13

votes

1

answer

447

views

A 3-CNF formula that requires resolution width $5$

cc.complexity-theory lo.logic sat proof-complexity

Apr 13 '13 at 19:04 Community♦ 1

2

10

votes

4

answers

529

views

An easy case of SAT that is not easy for tree resolution

sat proof-complexity

Jan 23 '15 at 17:15 Community♦ 1

6

votes

0

answers

271

views

Stronger reductions in parameterized complexity

cc.complexity-theory reference-request parameterized-complexity

Dec 2 '17 at 21:18 domotorp 12.4k

3

votes

0

answers

83

views

Eliminating tautological axioms in tree-like $k$-DNF resolution

reference-request proof-complexity resolution

9h ago Jan Johannsen 4,344

Theoretical Computer Science Stack Exchange works best with JavaScript enabled