Re: Is there an EXPSPACE complete language?
- From: rani_sharoni@xxxxxxxxxxx
- Date: 19 Jan 2006 02:46:47 -0800
>>But if such class C has complete language L then:
>>EXPTIME^L <= EXPSPACE^L <= C <= P^L
>>EXPSPACE^L <= C: since C is closed under composition with exponential
>>functions
>>C <= P^L: by definition
>You're right, I didn't think this through. The "standard complete language"
>as I stated it is incorrect. For NP, for example, the standard complete
>language is really
Here is a quite presume thought.
It's proven that if PH (polynomial hierarchy) does NOT have a complete
language then P != NP.
Otherwise PH will collapse to P which makes SAT PH complete.
I (boldly) thought that it might be possible to show that PH doesn't
have complete language using "similar" considerations.
Is it considered to be "harder" problem than P != NP?
Thanks,
Rani
.
- Follow-Ups:
- Re: Is there an EXPSPACE complete language?
- From: tchow
- Re: Is there an EXPSPACE complete language?
- References:
- Is there an EXPSPACE complete language?
- From: rani_sharoni
- Re: Is there an EXPSPACE complete language?
- From: rani_sharoni
- Re: Is there an EXPSPACE complete language?
- From: tchow
- Re: Is there an EXPSPACE complete language?
- From: rani_sharoni
- Re: Is there an EXPSPACE complete language?
- From: tchow
- Is there an EXPSPACE complete language?
- Prev by Date: Re: Hamiltonian Cycles algorithm
- Next by Date: Re: Looking for a fast algorithm
- Previous by thread: Re: Is there an EXPSPACE complete language?
- Next by thread: Re: Is there an EXPSPACE complete language?
- Index(es):
Relevant Pages
|