Skip to main content
Computer Science
3cnf's user avatar
3cnf's user avatar
3cnf's user avatar
3cnf
  • Member for 5 years, 5 months
  • Last seen more than a month ago
Profile Activity
Stats
183
reputation
5k
reached
12
answers
1
question
Communities
View all
Badges
This user doesn’t have any gold badges yet.
1
silver badge
9
bronze badges
Top tags
View all tags
9
Score
7
Posts
54
Posts %
3
Score
2
Posts
15
Posts %
3
Score
1
Posts
8
Posts %
2
Score
2
Posts
15
Posts %
2
Score
2
Posts
15
Posts %
2
Score
1
Posts
8
Posts %
Top posts
View all questions and answers
answer
3
Why can KARP reductions be used to define completeness for complexity classes in the polynomial hierachy?
Aug 29, 2019
answer
2
Karatsuba Multiplication Rule in dividing a Number in two parts
Jul 23, 2019
answer
2
The padding argument in the proof of NTIME(n) ⊆ DTIME(n^1.2) implies Σ2-TIME(n^8) ⊆ NTIME(n^9.6)
Aug 21, 2019
answer
2
BosonSampling: $\# P \subseteq FBPP^{{NP}^{\mathcal{O}}}$ implies $P^{\#P}\subseteq BPP^{{NP}^{\mathcal{O}}}$
Sep 4, 2019
question
1
Sensitivity and block sensitivity of specific problem, is there an errata? Arora-Barak exercise 12.4
Jul 8, 2019
answer
1
TQBF PSPACE-COMPLETE : Why this algorithm is exponential but Savitch's not?
Jul 28, 2019
answer
1
Complexity guess and induction proof
Jul 30, 2019
answer
1
Basic classical linear error correcting code for bits exercice (from Nielsen & Chuang)
Jul 31, 2019
answer
1
Rice Theorem - Problem to understand and apply it
Aug 31, 2019
answer
1
If a sparse language is NP complete, then are all languages in NP in P/poly?
Oct 30, 2019