Computer Science
rb612
  • Member for 5 years, 4 months
Profile Activity
Stats
389
reputation
5k
reached
0
answers
12
questions
About
Apparently, this user prefers to keep an air of mystery about them.

Communities (21)

Top network posts

This user doesn’t have any gold badges yet.
1
silver badge
10
bronze badges
View all badges

Top tags (19)

Score 0
Posts 7
Posts % 58
Score 0
Posts 6
Score 0
Posts 5
Score 0
Posts 2
Score 0
Posts 2
Score 0
Posts 2
View all tags →

Top posts (12)

All Questions Answers
Votes Newest
6 How do we know for sure that EXPTIME ≠ P? Jun 1 '16
5 Is EXPTIME "solvable" or "checkable" in exponential time? May 29 '16
4 What complexity class would this version of generalized chess fall? Jun 2 '16
3 How are games like chess provably harder than NP? Jun 3 '16
2 Questions on Sipser's NP implying verifiability? Apr 14 '18
2 How does (non)deterministic time relate to verifiability? Jun 2 '16
1 How is it possible that an equational theory be terminating? Mar 28 '20
1 Injectivity not required for unification algorithms? Mar 25 '20
1 NP and verifiability equivalence - does this guarantee that any certificate can be verified in polynomial time? Jan 11 '18
1 Second-order Markov text generation? Jul 2 '17
View all questions and answers →

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.