Theoretical Computer Science
Peter Boothe's user avatar
Peter Boothe's user avatar
Peter Boothe's user avatar
Peter Boothe
  • Member for 13 years, 3 months
  • Last seen more than 2 years ago
Profile Activity
Stats
1,791
reputation
173k
reached
21
answers
0
questions
Communities
View all
About

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

Now at Google.

Badges
View all badges
This user doesn’t have any gold badges yet.
13
silver badges
17
bronze badges
Top tags
View all tags
67
Score
8
Posts
38
Posts %
37
Score
4
Posts
19
Posts %
37
Score
2
Posts
10
Posts %
28
Score
4
Posts
19
Posts %
28
Score
2
Posts
10
Posts %
28
Score
2
Posts
10
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
29
Shortest string containing all fixed-length substrings
Jul 1, 2011
answer
18
Is the half-filled magic square problem NP-complete?
Dec 21, 2010
answer
17
Hard Instances for graph isomorphism testing
Apr 9, 2011
answer
16
Is there any way to differentiate between "sort of" Turing-Complete and "really" Turing-Complete?
Jan 23, 2011
answer
12
How do I get started in theoretical CS ?
Dec 20, 2010
answer
12
Problem teaching computability
Feb 20, 2011
answer
11
Data for testing graph algorithms
Aug 30, 2010
answer
9
Why is it important to prove that a problem is NP-complete?
Dec 8, 2010
answer
8
Models of random graphs, for real computer networks
Apr 29, 2011
answer
7
Algorithms from the Book
Aug 30, 2010
Top network posts
View all network posts
15
How to typeset a prefix tree (aka trie)
15
PhD thesis layouts from around the world
5
C function to find and delete a node from a singly linked list

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.