## Proceedings, Volume 9, Part 1994 |

### From inside the book

Results 1-3 of 30

Page 281

That is, any language in PSPACE can be recognized by a PCDS in which the

verifier uses O(logn) coin flips and queries only a ... We use this characterization

of PSPACE to show that certain stochastic

...

That is, any language in PSPACE can be recognized by a PCDS in which the

verifier uses O(logn) coin flips and queries only a ... We use this characterization

of PSPACE to show that certain stochastic

**PSPACE**-**hard**functions are as hard to...

Page 356

Abstract We use variants of the generalized CNF satisfiability problems SAT(S) of

[Sc78] to characterize the efficient approximability of a number of basic NP and

Abstract We use variants of the generalized CNF satisfiability problems SAT(S) of

[Sc78] to characterize the efficient approximability of a number of basic NP and

**PSPACE**-**hard**optimization problems in the literature. In contrast with the recent ...Page 358

[CF+93] we have that Corollary 2.5 For each set S such that the problem SAT(S)

is NP-complete, there exists a constant e > 0 such that approximating the

problem MAX QSAT(S) within a ratio e is

show ...

[CF+93] we have that Corollary 2.5 For each set S such that the problem SAT(S)

is NP-complete, there exists a constant e > 0 such that approximating the

problem MAX QSAT(S) within a ratio e is

**PSPACE**-**hard**. The previous two resultsshow ...

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Approximate Sets | 11 |

Polynomial Time TruthTable Reductions to PSelective Sets | 24 |

On the Query Complexity of Clique Size and Maximum Satisfiability | 31 |

Copyright | |

25 other sections not shown

### Other editions - View all

### Common terms and phrases

acceptance types algorithm assume binary Boolean Boolean circuit circuit collapses complete sets complexity classes Complexity Theory Computer Science configuration conjecture consider construction Corollary countable defined Definition denote deterministic DLOGTIME encoding exists exponential fan-in finite formula func function gate given graph guess hard hierarchy holds IEEE implies input head integer isomorphism leaf languages Lemma length live blocks logspace logspace reductions lower bound many-one many-one reduction martingale MAX3SAT NEXPTIME nodes nondeterministic Note NP-complete NP-hard O(logn optimal oracle oracle Turing machine output p-selective set P/poly path Player polynomial polynomial hierarchy polynomial-time predicate prob probabilistic Probabilistic Turing Machine probability Proc proof of Theorem proof systems Proposition protocol prove PSPACE PSPACE-hard recursive reductions representation class satisfying sequence simulate space bound strategy strings Structure in Complexity subset tape tion truth-table reducible Turing machine Ultrafilter unambiguous variables verifier weakly