Theoretical Computer Science
Meta user
Network profile
1,761
reputation
13
17

Peter Boothe

Formerly assistant professor in the computer science department at Manhattan College.

Now at Google.

21
answers
0
questions
~155k
people reached
  • New York, NY
  • imprompt.us
  • Member for 9 years, 5 months
  • 317 profile views
  • Last seen Sep 23 '16 at 21:04

Communities (16)

Top network posts

Top tags (33)

Score 67
Posts 8
Posts % 38
Score 37
Posts 2
Score 36
Posts 4
Score 27
Posts 4
Score 27
Posts 2
Score 27
Posts 2
View all tags →

Top posts (21) All Questions Answers | Votes Newest

29 Shortest string containing all fixed-length substrings Jul 1 '11
18 Is the half-filled magic square problem NP-complete? Dec 21 '10
17 Hard Instances for graph isomorphism testing Apr 9 '11
15 Is there any way to differentiate between “sort of” Turing-Complete and “really” Turing-Complete? Jan 23 '11
12 Problem teaching computability Feb 20 '11
11 Data for testing graph algorithms Aug 30 '10
11 How do I get started in theoretical CS ? Dec 20 '10
9 Why is it important to prove that a problem is NP-complete? Dec 8 '10
8 Models of random graphs, for real computer networks Apr 29 '11
7 Algorithms from the Book. Aug 30 '10
View all questions and answers →

Badges (30)

Gold

—

Silver

13

Rarest

Bronze

17

Rarest

View all badges →