Theoretical Computer Science
Tayfun Pay's user avatar
Tayfun Pay's user avatar
Tayfun Pay's user avatar
Tayfun Pay
  • Member for 13 years
  • Last seen this week
Profile Activity
Stats
2,559
reputation
144k
reached
18
answers
17
questions
Communities
About

Research Gate Profile
Google Scholar Profile
LinkedIn Profile
Tumblr Page
Github Page
AboutMe Page

Badges
View all badges
2
gold badges
18
silver badges
44
bronze badges
Top tags
View all tags
55
Score
30
Posts
86
Posts %
40
Score
13
Posts
37
Posts %
30
Score
12
Posts
34
Posts %
19
Score
4
Posts
11
Posts %
19
Score
2
Posts
6
Posts %
12
Score
2
Posts
6
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
23
Survey on #P and/or counting problems
May 5, 2011
question
18
List of theorems stating that P does not equal NP if and only if
Jan 19, 2012
answer
15
Counting the number of satisfying assignments in a POSITIVE CNF-SAT
May 13, 2017
question
14
Is Quasi-polynomial time in PSPACE?
Oct 12, 2011
question
12
What is the precise definition of Random K-SAT?
Jan 30, 2011
answer
12
Consequences of NP=PSPACE
Feb 13, 2014
question
11
What are the current best known upper and lower bounds on the (un)satisfiability threshold for random k-sat and/or 3-sat?
Sep 30, 2010
question
11
What do we know about the phase transition of #P-Complete problems?
Aug 18, 2011
question
11
What is the complexity of counting the number of solutions of a P-Space Complete problem? How about higher complexity classes?
Aug 26, 2011
question
11
Relativized world where ${\bf P^A}={\bf NP^A}\not = {\bf PP^A}$
Mar 30, 2013

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.