Theoretical Computer Science
Profile Activity
Meta user
Network profile
1,686
reputation
1
12
20

holf

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

21
answers
1
question
~7k
people reached
  • Lille, France
  • florent.capelli.me
  • Member for 4 years, 3 months
  • 244 profile views
  • Last seen 9 hours ago

Communities (2)

Top network posts

Top tags (0)

This user has not participated in any tags.

Top posts (22)

All Questions Answers
Votes Newest
20 Counting the number of satisfying assignments in a POSITIVE CNF-SAT May 13 '17
14 On theoretical aproaches for solving $\mathsf{SAT}$ in special cases Sep 27 '19
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
8 Containment problem of an acyclic NFA in an NFA Feb 2 '20
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 W[1]-hard problems with FPT time approximation algorithms Apr 29 '18
6 Complexity of SAT parameterized by treewidth Oct 9 '19
View all questions and answers →

Badges (33)

Gold

1

Rarest

Silver

12

Rarest

Bronze

20

Rarest

View all badges →