2,843 reputation
21739
bio website cims.nyu.edu/~hbennett
location New York, NY, USA
age
visits member for 4 years, 8 months
seen 6 hours ago

I am a graduate student at NYU.


May
19
reviewed Approve Enumerating set combinations in an order that maximises the number of previously unseen subsets
May
19
awarded  Good Question
May
17
awarded  Nice Answer
May
17
answered What is known about this TSP variant?
May
12
comment Milestones in counting complexity
@MarzioDeBiasi: That should be an answer!
May
9
reviewed Approve Are there any topics in theoretical CS that are more about pure math?
May
1
reviewed Reject Is there a generalization of the GO game that is known to be Turing complete?
Apr
29
comment Is there a generalization of the GO game that is known to be Turing complete?
Sorry, I don't understand this at all. What you're describing still has a finite number of states, so it can't be Turing complete. More importantly, what do "divinatory elements" and "religious dimensions" have to do with anything?
Apr
29
comment Is there a generalization of the GO game that is known to be Turing complete?
Your link only shows what look like "trading cards" without any discussion of Go that I can see. I think this is an advertisement for your patent and not an answer to the question.
Apr
28
reviewed Approve List of number theoretic or algebraic problems in various complexity classes
Apr
28
reviewed Approve What would signify hierarchy collapse to first level?
Apr
23
reviewed Reject Implemented code to compute pathwidth (= Node search number, vertex separation number, interval thickness)
Apr
23
revised Complexity for single-linkage clustering with max norm
edited title
Apr
12
revised Applications of TCS to classical mathematics?
added 1 character in body
Apr
8
comment Any known connections between open problems for time and space: P vs L, NP vs NL, BPP vs BPL, ⊕P vs ⊕L
Where are you getting NL = ZPL from? That seems unlikely to be known (or true).
Apr
8
revised FPT vs W[P] - Parameterized Complexity
Fixed minor latex typo.
Apr
4
reviewed Reject What is the minimum number of bits required to store a sudoku puzzle?
Mar
31
reviewed Approve The Goemans-Williamson algorithm in the $SOS$ framework
Mar
30
reviewed Approve Are there sparsifiers that approximate vertices rather than edges?
Mar
25
revised Fun with inverse Ackermann
Fixed minor latex typo.