2022 Developer Survey is open! Take survey.
Theoretical Computer Science
user avatar
user avatar
user avatar
Ludovic Patey
  • Member for 11 years, 9 months
  • Last seen more than 5 years ago
Profile Activity
Stats
1,733
reputation
19k
reached
3
answers
13
questions
Communities
About

I'm student in computer science in the Ecole Normale Supérieure in Paris.

Badges
View all badges
This user doesn’t have any gold badges yet.
11
silver badges
21
bronze badges
Top tags
View all tags
14
Score
15
Posts
94
Posts %
12
Score
1
Posts
6
Posts %
12
Score
1
Posts
6
Posts %
2
Score
4
Posts
25
Posts %
2
Score
1
Posts
6
Posts %
0
Score
6
Posts
38
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
30
Are there canonical non-relativizing techniques?
Oct 8, 2010
question
30
Justification of log f in DTIME hierarchy theorem
Mar 5, 2011
question
12
Does diagonalization captures the essence of class separation ?
May 14, 2011
question
12
Reducing threshold questions to finiteness questions
Dec 15, 2011
answer
12
Why doesn't P=NP imply P=AP (i.e. P=PSPACE)?
Mar 10, 2011
question
11
Do many-one reductions and Turing reductions define the same class NPC
Aug 27, 2010
question
10
What are the complexities of the following SAT subsets ?
Sep 21, 2010
question
10
Is there any sparse language known to be in NPI under the $P \neq NP$ assumption ?
Sep 27, 2010
question
9
Literature around NP vs EXPTIME
May 11, 2011
question
6
$\mathsf{UPH}$, $\Pi_2^{\mathsf{P}}$ and $\mathsf{PP}$
Jun 30, 2011
Top network posts
View all network posts
11
Infinite decreasing sequence by the Turing jump
6
Is 0' of PA degree relative to a non-low set?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.