bio | website | |
---|---|---|
location | ||
age | ||
visits | member for | 4 years, 9 months |
seen | Jul 31 at 5:15 | |
stats | profile views | 250 |
Jul 2 |
awarded | Curious |
Jan 11 |
awarded | Nice Question |
Nov 14 |
awarded | Notable Question |
Nov 4 |
awarded | Popular Question |
Sep 27 |
comment |
Nelson's program to show inconsistency of ZF
Maybe I'm missing something but what do the above two links have to do with the topic? |
Mar 30 |
awarded | Popular Question |
Nov 9 |
awarded | Yearling |
Aug 16 |
comment |
Why relativization can't solve NP !=P?
I'm confused by your last sentence since I can't fit it with the rest of your reply. Given that it talks about relativisation, do you mean that BPP can be separated from P given some oracle? Thanks! |
Aug 15 |
awarded | Commentator |
Aug 15 |
comment |
Why relativization can't solve NP !=P?
@Ricky - The abstract states that there exists an oracle relative to which co-NP does not have interactive proofs. Since IP^A \neq PSPACE ^A for some oracle A, everything works out. |
Aug 14 |
comment |
A polynomial-time algorithm for deciding whether a language has a polynomial time algorithm
By the search version of the problem, I meant the search version of the problem of deciding whether a particular language L \n NP was also in P i.e. finding a polynomial-time algorithm for L if one exists. At the time I wrote the question, I didn't know this problem (of deciding whether L in NP is also in P) was NP-hard. Thus I asked if there was any complexity difference between the search and decision versions. |
Aug 13 |
accepted | A polynomial-time algorithm for deciding whether a language has a polynomial time algorithm |
Aug 13 |
asked | A polynomial-time algorithm for deciding whether a language has a polynomial time algorithm |
Aug 8 |
accepted | A language complete for NP intersection co-NP |
Aug 8 |
asked | A language complete for NP intersection co-NP |
Jun 3 |
comment |
Dissecting a tetrahedron into orthoschemes
Hey, Thanks for the response. I read through the paper and unfortunately the references containing the proof that a tetrahedra can be dissected into 12 orthoschemes are in German. Do you know of an English reference that has this material? Thanks |
Jun 3 |
revised |
How do you find out the latest news in fields other than your own?
Fixed link |
Jun 3 |
revised |
How do you find out the latest news in fields other than your own?
added 153 characters in body |
Jun 3 |
answered | How do you find out the latest news in fields other than your own? |
May 21 |
awarded | Enthusiast |