Theoretical Computer Science
holf's user avatar
holf's user avatar
holf's user avatar
holf
  • Member for 6 years, 11 months
  • Last seen this week
Profile Activity
Stats
2,089
reputation
11k
reached
29
answers
2
questions
Communities
About

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

Badges
View all badges
1
gold badge
14
silver badges
20
bronze badges
Top tags
View all tags
45
Score
5
Posts
16
Posts %
41
Score
9
Posts
29
Posts %
31
Score
7
Posts
23
Posts %
27
Score
3
Posts
10
Posts %
25
Score
3
Posts
10
Posts %
21
Score
6
Posts
19
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
20
Counting the number of satisfying assignments in a POSITIVE CNF-SAT
May 13, 2017
answer
15
On theoretical aproaches for solving $\mathsf{SAT}$ in special cases
Sep 27, 2019
answer
13
How to talk about theory
Oct 23, 2018
answer
10
Is deciding whether changing one entry decreases the permanent of a matrix in the polynomial hierarchy?
Oct 2, 2018
answer
9
Complexity of computing generalised determinants. (P - #P transition)
Dec 2, 2016
answer
8
Containment problem of an acyclic NFA in an NFA
Feb 2, 2020
question
7
SETH-like hypothesis for machine with oracle access to some level of PH
Dec 14, 2016
answer
6
Easy problems with hard counting versions
Oct 21, 2016
answer
6
Complexity of SAT parameterized by treewidth
Oct 9, 2019
answer
6
W[1]-hard problems with FPT time approximation algorithms
Apr 29, 2018
Top network posts
View all network posts
10
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?
6
Relationship between the parameters tree width and the maximum degree

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.