Reductions in PSPACE
- From: sasha mal <sashaDELETEITmal@xxxxxxxxxxxxxxxxxx>
- Date: Sun, 16 Jul 2006 16:49:19 +0200
Another question.
I know two reductions for PSPACE: poly-time and logspace (a special case of polytime). Is there any strong argument about whether the two give different classes or the same class of PSPACE-complete problems?
Regards,
Sasha.
.
- References:
- Reductions in P
- From: ahuznot
- Reductions in P
- Prev by Date: Re: Reductions in P
- Next by Date: easy combinatorial algorithm, or not??
- Previous by thread: Re: Reductions in P
- Next by thread: easy combinatorial algorithm, or not??
- Index(es):
