The Stack Overflow podcast is back! Listen to an interview with our new CEO.
Computer Science
Meta user
Network profile
237
reputation
1
8

rb612

Apparently, this user prefers to keep an air of mystery about them.

0
answers
10
questions
~3k
people reached
  • Member for 3 years, 4 months
  • 14 profile views
  • Last seen Oct 12 at 4:58

Communities (19)

Top network posts

Top tags (16)

Score 0
Posts 7
Posts % 70
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 (10) 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 How does (non)deterministic time relate to verifiability? Jun 2 '16
1 Questions on Sipser's NP implying verifiability? Apr 14 '18
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
1 General Intelligence Utility Function Mar 28 '17
0 Looping through random integers - will it halt with probability 1? Nov 18 '17

Badges (9)

Gold

—

Silver

1

Rarest

Bronze

8

Rarest