2,604 reputation
21638
bio website cims.nyu.edu/~hbennett
location New York, NY, USA
age
visits member for 4 years
seen 1 hour ago

I am a graduate student at NYU.


2d
revised The Stalin compiler brutally optimizes, but how?
Fixed grammar
2d
reviewed Approve suggested edit on The Stalin compiler brutally optimizes, but how?
Sep
21
revised Is P equal to the intersection of all superpolynomial time classes?
Fixed spelling typo.
Sep
14
comment $NP \not\subseteq BPP \implies NP_{\mathbb{C}} \not\subseteq P_{\mathbb{C}}$
@usul: complexityzoo.uwaterloo.ca/Complexity_Zoo:N#npc2
Sep
10
reviewed Approve suggested edit on Questions on unification theory (and its application to DAG isomorphism )
Sep
8
awarded  Yearling
Sep
6
comment Is there a reason we haven't been able to prove that the existence of natural NPI problems even conditionally under assumption NPI is not empty?
I think Scott's answer to your last question (particularly the middle paragraph) is great intuition for why that is. I was actually Googling for it as a reference for this question when I realized he had posted it as an answer to your previous question.
Sep
5
comment Is there a reason we haven't been able to prove that the existence of natural NPI problems even conditionally under assumption NPI is not empty?
Why do you think NPI and NPC should be "symmetric"? Isn't this like your previous question here: cstheory.stackexchange.com/questions/20930/… ?
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"?