New answers tagged complexity-classes
            
                3
            
            votes
        
        
            
        Repeating a PSPACE problem exponentially many times
                    You do not need exponential space for this, and you can in fact solve this problem by iterating over subsets one by one.
The key point is that there is a way to itereate over all possible sets without ...
                
            
       
        Top 50 recent answers are included
Related Tags
complexity-classes × 548complexity-theory × 451
time-complexity × 111
np × 61
space-complexity × 58
np-complete × 47
reductions × 34
p-vs-np × 24
turing-machines × 23
oracle-machines × 23
computability × 18
decision-problem × 18
randomized-algorithms × 16
polynomial-time × 16
reference-request × 15
np-hard × 15
nondeterminism × 15
quantum-computing × 15
closure-properties × 14
circuits × 14
algorithms × 12
graphs × 12
approximation × 12
probabilistic-algorithms × 12
terminology × 11