Computer Science
Farewell Stack Exchange's user avatar
Farewell Stack Exchange's user avatar
Farewell Stack Exchange's user avatar
Farewell Stack Exchange
  • Member for 6 years, 5 months
  • Last seen more than 1 year ago
Profile Activity
Stats
321
reputation
14k
reached
2
answers
30
questions
Communities
View all
About

Farewell Stack Exchange

Badges
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
17
bronze badges
Top tags
View all tags
0
Score
17
Posts
53
Posts %
0
Score
11
Posts
34
Posts %
0
Score
10
Posts
31
Posts %
0
Score
9
Posts
28
Posts %
0
Score
8
Posts
25
Posts %
0
Score
7
Posts
22
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
6
Is there a polynomial time algorithm to determine whether an 'up down' language is 'emptible'?
Jun 17, 2017
question
6
Can deterministic Turing machine beats/wins (if possible) the "Bombs and Levers" game in polynomial time?
Jul 19, 2017
question
4
Can quantum computer compute the sum of $n$ natural numbers in $\Theta(\log n)$ time?
Aug 12, 2017
question
2
Complexity of simplifying two-variable algebraic expression
Jul 11, 2017
question
2
What is the set of all minimal 3CNF formulas?
Jul 17, 2017
question
2
Is computing the cardinality of sum of regular expressions without kleene star closure EXPTIME problem?
Jul 23, 2017
question
2
What is the set of all maximal 3CNF formulas?
Jul 26, 2017
question
2
What is the complexity to show this theorem?
Jul 26, 2017
question
2
Does an algorithm with complexity $\Theta(2^\sqrt{n})$ to solve any NP problem count as "good" and practical as any other polynomial algorithm?
Aug 12, 2017
question
2
Does every 3CNF propositional formula has an equivalent 2CNF propositional formula?
Aug 18, 2017

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.