Theoretical Computer Science
Peter Boothe
  • Member for 11 years, 5 months
  • Last seen more than a month ago
Profile Activity
Stats
1,771
reputation
166k
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
2
Posts
10
Posts %
36
Score
4
Posts
19
Posts %
28
Score
2
Posts
10
Posts %
28
Score
2
Posts
10
Posts %
27
Score
4
Posts
19
Posts %
Top posts
View all questions and answers
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
16
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
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.