Theoretical Computer Science
Meta user
Network profile
1,371
reputation
1
10
20

holf

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

17
answers
1
question
~5k
people reached
  • Lille, France
  • florent.capelli.me
  • Member for 2 years, 11 months
  • 172 profile views
  • Last seen 4 mins ago

Communities (2)

Top network posts

Top tags (33)

Score 39
Posts 5
Posts % 28
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 (18) 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
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
6 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
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
5 Complexity of SAT parameterized by treewidth Oct 9
View all questions and answers →

Badges (31)

Gold

1

Rarest

Silver

10

Rarest

Bronze

20

Rarest

View all badges →