2,605 reputation
21538
bio website cims.nyu.edu/~hbennett
location New York, NY, USA
age
visits member for 3 years, 11 months
seen 3 hours ago

I am a graduate student at NYU.


Aug
21
comment What are some good introductory books on type theory?
Yes, TAPL is the book. There's also Pierce's "Advanced Topics in Types and Programming Languages" as a follow-up.
Aug
19
comment What is the complexity of counting the number of solutions of a P-Space Complete problem? How about higher complexity classes?
Isn't this covered by Tsuyoshi and Noam's comments above?
Aug
6
comment Another algorithm for stable matching?
This seems a little vague without specifying what properties you would hope an additional algorithm to have.
Jul
25
revised Does $\# \mathsf{P}\subseteq \mathsf{FP}^{\mathsf{PH}}$?
Fixed title spelling.
Jul
19
reviewed Approve suggested edit on Examples of $2^{\Theta(n^2)}\text{poly}(n)$-time algorithms
Jul
2
awarded  Curious
Jul
1
awarded  Nice Answer
Jul
1
answered Examples of $\Sigma_2^p$ complete problems?
Jun
30
comment Examples of $\Sigma_2^p$ complete problems?
Take a look at this compendium: ovid.cs.depaul.edu/documents/phcom.pdf
May
25
comment Problems that are decidable but cannot be verified in polynomial time
@GeoffreyIrving: You're right, thanks. Fixed. I'm not sure what I (mistakenly) had in mind when I wrote that, but there are "sub problems" of Go, like LADDERS, which are PSPACE-complete: link.springer.com/chapter/10.1007%2F3-540-45579-5_16
May
25
revised Problems that are decidable but cannot be verified in polynomial time
Fixed complexity of chess/Go.
May
19
comment Would a purely topological computational model be useful in decision problems in topology?
Also, what's a "braiding computer"?
May
12
reviewed Approve suggested edit on Examples of hardness phase transitions
May
12
reviewed Approve suggested edit on Phase Transitions in NP Hard Problems
May
4
reviewed Reject suggested edit on Explain P = NP problem to 10 year old
Apr
26
answered List of TCS conferences and workshops
Apr
24
reviewed Approve suggested edit on Does $\delta^+(G)+\delta^-(G) \geq n$ imply strong connectivity?
Apr
23
reviewed Approve suggested edit on Does Dirac's theorem on Hamiltonian cycles only apply to undirected graphs?
Apr
15
reviewed Approve suggested edit on Are there any problems whose best known algorithm has run time $O\left(\frac{f(n)}{\log n}\right)$
Apr
12
reviewed Approve suggested edit on Convolution products in partial semigroups