Skip to main content
Computer Science
holf's user avatar
holf's user avatar
holf's user avatar
holf
  • Member for 7 years, 7 months
  • Last seen this week
Profile Activity
Stats
956
reputation
24k
reached
16
answers
0
questions
Communities
About

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

Badges
View all badges
This user doesn’t have any gold badges yet.
5
silver badges
10
bronze badges
Top tags
View all tags
22
Score
3
Posts
19
Posts %
14
Score
3
Posts
19
Posts %
13
Score
2
Posts
12
Posts %
12
Score
1
Posts
6
Posts %
12
Score
1
Posts
6
Posts %
10
Score
2
Posts
12
Posts %
Top posts
View all questions and answers
12
Proof that TAUT is coNP-complete (or that a problem is coNP-complete if its complement is NP-complete)
Jun 9, 2017
7
Is #HORNSAT polynomial?
Apr 19, 2017
7
What does the $O^*$ notation mean?
Jan 28, 2018
7
Relationship between the parameters tree width and the maximum degree
Oct 26, 2022
6
Is the halting problem claim true with the advent of AI
Apr 19, 2017
5
A minimal automaton for a language quotient $w^{-1}L$ if $L$ is regular
Dec 7, 2016
4
Proof that n^2 = O(logn)?
Feb 20, 2018
3
SAT formula and satisfying assignment yield another different satisfying assignment
Jun 9, 2017
3
Can the Same Function Have Different Asymptotic?
Jan 19, 2018
3
Regular Expression with at least one a, even number of b
Nov 14, 2019
Top network posts
View all network posts
20
Counting the number of satisfying assignments in a POSITIVE CNF-SAT
16
On theoretical aproaches for solving $\mathsf{SAT}$ in special cases
13
How to talk about theory
10
Is deciding whether changing one entry decreases the permanent of a matrix in the polynomial hierarchy?