Theoretical Computer Science
Network profile
91
reputation
1
7

Leo

I'm currently a PhD student in University of Tours, France. My research interests are Exact Exponential Algorithms, $\textbf{NP-hard}$ Problems, Scheduling Problems.

2
answers
3
questions
~3k
people reached
  • France
  • Member for 4 years, 10 months
  • 26 profile views
  • Last seen Jul 7 '19 at 14:17

Communities (8)

Top network posts

Top tags (9)

Score 0
Posts 3
Posts % 60
Score 0
Posts 2
Score 0
Posts 2
Score 0
Posts 1
Score 0
Posts 1
Score 0
Posts 1
View all tags →

Top posts (5) All Questions Answers | Votes Newest

6 Confusing running time analysis for the Divide & Conquer algorithm of Hamiltonian Path problem Jul 19 '16
1 Complexity analysis on a parameterized recurrence relation Apr 24 '15
0 Complexity analysis on a parameterized recurrence relation May 4 '15
0 Find the maximum subset contained by a ball of radius R Jun 16 '16
-1 Dynamic Programming vs Greedy Algorithm Feb 27 '16

Badges (8)

Gold

—

Silver

1

Rarest

Bronze

7

Rarest