Theoretical Computer Science
holf
  • Member for 5 years, 3 months
  • Last seen this week
Profile Activity
Stats
1,710
reputation
8k
reached
22
answers
1
question
Communities
About

Mainly interested in (parametrized/counting) complexity theory, graph theory and knowledge compilation.

Badges
View all badges
1
gold badge
13
silver badges
20
bronze badges
Top tags
View all tags
43
Score
5
Posts
22
Posts %
35
Score
8
Posts
35
Posts %
34
Score
2
Posts
9
Posts %
29
Score
6
Posts
26
Posts %
27
Score
3
Posts
13
Posts %
25
Score
3
Posts
13
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
20
Counting the number of satisfying assignments in a POSITIVE CNF-SAT
May 13 '17
14
On theoretical aproaches for solving $\mathsf{SAT}$ in special cases
Sep 27 '19
13
How to talk about theory
Oct 23 '18
10
Is deciding whether changing one entry decreases the permanent of a matrix in the polynomial hierarchy?
Oct 2 '18
9
Complexity of computing generalised determinants. (P - #P transition)
Dec 2 '16
8
Containment problem of an acyclic NFA in an NFA
Feb 2 '20
7
SETH-like hypothesis for machine with oracle access to some level of PH
Dec 14 '16
6
Easy problems with hard counting versions
Oct 21 '16
6
W[1]-hard problems with FPT time approximation algorithms
Apr 29 '18
6
Complexity of SAT parameterized by treewidth
Oct 9 '19
Top network posts
View all network posts
9
Proof that TAUT is coNP-complete (or that a problem is coNP-complete if its complement is NP-complete)
7
Is #HORNSAT polynomial?
7
What does the $O^*$ notation mean?

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.