Tyson Williams
  • Member for 10 years, 11 months
  • Last seen more than a month ago
2 answers
33 votes
2k views
18 bookmarks
When does "X is NP-complete" imply "#X is #P-complete"?
3 answers
22 votes
904 views
9 bookmarks
Complexity of Tensor Rank over an Infinite Field
0 answers
16 votes
264 views
4 bookmarks
When does adding edges decrease the cover time of a graph?
4 answers
13 votes
2k views
2 bookmarks
Alan Turing Documentaries
1 answers
7 votes
166 views
2 bookmarks
Deciding bound on Tensor Rank for a fixed value
2 answers
7 votes
380 views
Decision problem related to coloring
2 answers
7 votes
345 views
1 bookmarks
What is known about the H-factor problem?
0 answers
6 votes
160 views
2 bookmarks
Immutable Space Model
0 answers
5 votes
98 views
Improve analysis of quantum random walk
0 answers
5 votes
187 views
Standard reference for efficient computation of non-intersecting Eulerian circuit