2,634 reputation
21638
bio website cims.nyu.edu/~hbennett
location New York, NY, USA
age
visits member for 4 years, 7 months
seen 5 hours ago

I am a graduate student at NYU.


2d
reviewed Reject Implemented code to compute pathwidth (= Node search number, vertex separation number, interval thickness)
2d
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.
Mar
17
comment VC-dimension of triangles in 2D space
@Daniel: Shattering means that you have to be able to separate all +/- labellings of the same set of points, I think.
Mar
12
reviewed Approve Deciding whether a context-free language is regular
Mar
11
comment Why study type theory?
What is "type theory per se"?
Mar
11
revised Is the Cheeger constant $\mathsf{NP}$-hard?
edited tags
Mar
9
comment Deterministic Randomness Extractors
My comment was based on the previous edit. I thought you were trying to emphasize that the min-entropy is very close to $n$ (off by an additive constant), which is stronger than just saying it's $\Omega(n)$ (although the latter is true and still certainly makes your point).
Mar
9
comment Deterministic Randomness Extractors
I think you mean "will have min-entropy $\geq n - 1$".
Mar
3
reviewed Approve What is the difference between propositions and judgments?
Mar
2
comment Spectral Gap in Expander Graphs
The whole purpose of the spectral gap is as a measure of how connected the graph is, so it's weird to think that removing edges wouldn't affect it. Imagine starting with the complete graph (which has spectral gap 1), and deleting edges until you have another connected, regular graph (which must have spectral gap <1).
Mar
2
comment Spectral Gap in Expander Graphs
No? What makes you think this might be true?
Feb
23
revised How exactly does lambda calculus capture the intuitive notion of computability?
edited body
Feb
22
comment Algorithm to determine if given algorithm runs in polynomial time
@SashoNikolov: Good point! Thank you!