A message from our CEO about the future of Stack Overflow and Stack Exchange. Read now.
Theoretical Computer Science
Meta user
Network profile
1,451
reputation
1
11
20

holf

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

18
answers
1
question
~6k
people reached
  • Lille, France
  • florent.capelli.me
  • Member for 3 years, 3 months
  • 188 profile views
  • Last seen 55 mins ago

Communities (2)

Top network posts

Top tags (35)

Score 41
Posts 5
Posts % 26
Score 32
Posts 2
Score 27
Posts 6
Score 27
Posts 3
Score 25
Posts 5
Score 25
Posts 3
View all tags →

Top posts (19) All Questions Answers | Votes Newest

20 Counting the number of satisfying assignments in a POSITIVE CNF-SAT May 13 '17
13 How to talk about theory Oct 23 '18
12 On theoretical aproaches for solving $\mathsf{SAT}$ in special cases Sep 27 '19
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
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 Complexity of SAT parameterized by treewidth Oct 9 '19
5 W[1]-hard problems with FPT time approximation algorithms Apr 29 '18
5 Equivalence for Constant-width Read-Once Branching Programs with Distinct Orders Jan 25 '17
View all questions and answers →

Badges (32)

Gold

1

Rarest

Silver

11

Rarest

Bronze

20

Rarest

View all badges →