Theoretical Computer Science
Tom van der Zanden
  • Member for 7 years, 2 months
  • Last seen more than a month ago
Profile Activity
Stats
533
reputation
2k
reached
8
answers
0
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
3
silver badges
9
bronze badges
Top tags
View all tags
12
Score
1
Posts
12
Posts %
12
Score
1
Posts
12
Posts %
9
Score
3
Posts
38
Posts %
7
Score
2
Posts
25
Posts %
7
Score
1
Posts
12
Posts %
5
Score
2
Posts
25
Posts %
Top posts
All Questions Answers
Votes Newest
12
Problems not known to be PSPACE-complete
Mar 9 '15
7
Characterizing the set of problems solvable via network flow
Dec 5 '14
5
Upper bound for number of independent sets
Nov 27 '14
3
For two representations of finite length of one computable number are there $P$-time algorithms that compute one from another
Dec 10 '14
2
An edge orientation procedure to generate all acyclic orientations of a graph
Jan 1 '15
2
polytime transformation from a graph to a set of binary strings
Jan 18 '15
1
An algorithm for counting to Graham’s Number
May 23 '15
0
A simple challenge
Sep 7 '15
Top network posts
View all network posts
85
I unknowingly submitted plagiarised work
74
Why did Google not use an NP problem for their quantum supremacy experiment?
67
Examiner proof-reading master thesis before submission. Is this allowed?
53
Recognise Stack Exchange Sites by Their Icon
52
Including proofs of known theorems in master's thesis

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.