Theoretical Computer Science
Meta user
Network profile
1,161
reputation
1
9
19

holf

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

14
answers
1
question
~4k
people reached
  • Lille, France
  • florent.capelli.me
  • Member for 2 years, 10 months
  • 154 profile views
  • Last seen yesterday

Communities (2)

Top network posts

Top tags (31)

Score 27
Posts 3
Posts % 20
Score 25
Posts 3
Score 21
Posts 2
Score 20
Posts 1
Score 20
Posts 1
Score 15
Posts 5
View all tags →

Top posts (15) 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
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
4 Definition and Computational Model of EnumP Mar 29 '17
4 Why does this cut elimination procedure terminate (contraction case)? Jan 22 '17
View all questions and answers →

Badges (29)

Gold

1

Rarest

Silver

9

Rarest

Bronze

19

Rarest

View all badges →