Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory

June 28 1994-July 1 1994

Filter Results

Displaying Results 1 - 25 of 38
  • Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory

    Publication Year: 1994
    Request permission for commercial reuse | |PDF file iconPDF (126 KB)
    Freely Available from IEEE
  • On the query complexity of clique size and maximum satisfiability

    Publication Year: 1994, Page(s):31 - 42
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (996 KB)

    The paper explores the bounded query complexity of approximating the size of the maximum clique in a graph (clique size) and the number of simultaneously satisfiable clauses in a 3CNF formula (MAX3SAT). The results show that for certain approximation factors, approximating clique size and MAX3SAT are complete for corresponding bounded query classes under metric reductions. The completeness result ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial-time membership comparable sets

    Publication Year: 1994, Page(s):2 - 11
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (764 KB)

    The paper introduces and studies a notion called polynomial-time membership comparable sets, which is a generalization of P-selective sets. For a function g, a set A is called polynomial-time g-membership comparable if there is a polynomial-time computable function f such that for any x1,…,xm with m⩾g(max{|x1 |,…,|xm|}), outputs b∈... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random debaters and the hardness of approximating stochastic functions

    Publication Year: 1994, Page(s):280 - 293
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1196 KB)

    A random probabilistically checkable debate system (RPCDS) for a language L consists of a probabilistic polynomial-time verifier V and a debate between Player 1, who aims to prove that the input x is in L, and Player 0, who selects a move uniformly at random from the set of legal moves. This model is a natural restriction of the PCDS model (Condon et al., Proc. 25th ACM Symposium on Theory of Comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized CNF satisfiability problems and non-efficient approximability

    Publication Year: 1994, Page(s):356 - 366
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (768 KB)

    We use variants of the generalized CNF satisfiability problems SAT(S) of T.J. Schhaefer (1978) to characterize the efficient approximability of a number of basic NP and PSPACE-hard optimization problems in the literature. In contrast with the recent results, none of our proofs make use of interactive proof systems or of probabilistically checkable debate systems. In particular assuming P≠NP- or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relative to a random oracle, NP is not small

    Publication Year: 1994, Page(s):162 - 174
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (840 KB)

    The resource-bounded measure (J. Lutz, 1992) is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity classes. Lutz proposed the hypothesis that NP does not have measure zero in the class E2=DTIME(2polynomial), meaning loosely that NP contains a non-negligible subset of exponential time. This hypothesis im... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On functions computable with nonadaptive queries to NP

    Publication Year: 1994, Page(s):43 - 52
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (736 KB)

    We study FP||NP, the class of functions that can be computed with nonadaptive queries to an NP oracle. We show that optimization problems stemming from the known NP complete sets, where the optimum is taken over a polynomially bounded range, are hard for FP||NP. This is related to (and, in some sense, extends) work of Z. Chen and S. Toda (1991). In addit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Test instance generation for promised NP search problems

    Publication Year: 1994, Page(s):205 - 216
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (796 KB)

    We discuss the problem of generating test instances for promised NP search problems. A technical framework is proposed for studying this problem, and it is shown that all known distNP-hard search problems are “complete” for test instance generation problems View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximable sets

    Publication Year: 1994, Page(s):12 - 23
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (912 KB)

    Much structural work on NP-complete sets has exploited SAT's d-self-reducibility. We exploit the additional fact that SAT is a d-cylinder to show that NP-complete sets are p-superterse unless P=NP. In fact, every set that is NP-hard under polynomial-time no(1)-tt reductions is p-superterse unless P=NP. In particular no p-selective set is NP-hard under polynomial-time no(1)-tt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of learning with queries

    Publication Year: 1994, Page(s):324 - 337
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1012 KB)

    We survey recent research concerning the qualitative complexity of Angluin's (1993) model of learning with queries. In this model, there is a learner that tries to identify a target concept by means of queries to a teacher. Thus, the process can be naturally formulated as an oracle computation. Among the results we review there are: characterizations of the power of different learning protocols by... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generic separations

    Publication Year: 1994, Page(s):139 - 145
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (432 KB)

    M. Blum and R. Impagliazzo (Proc. 28th IEEE Symposium on Foundations of Computer Science, pp. 118-126, 1987), using techniques of Hartmanis and Hemachandra (1991) and Rackoff (1982), showed that if P = NP then P(G) = NP(G)∩co-NP(G) = UP(G), where G is a generic oracle. They left open the question as to whether these collapses occur at higher levels of the polynomial-time hierarchy. We give a s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-prover encoding schemes and three-prover proof systems

    Publication Year: 1994, Page(s):308 - 317
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (812 KB)

    Suppose two provers agree in a polynomial p and want to reveal a single value y=p(x) to a verifier where m is chosen arbitrarily by the verifier. Whereas honest provers should be able to agree on any polynomial p the verifier wants to be sure that with any (cheating) pair of provers the value y he receives is a polynomial function of x. We formalize this question and introduce multi-prover (quasi-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Alternation in interaction

    Publication Year: 1994, Page(s):294 - 303
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (760 KB)

    We study competing-prover one-round interactive proof systems. We show that one-round proof systems in which the first prover is trying to convince a verifier to accept and the second prover is trying to make the verifier reject recognized languages in NEXPTIME, and, with restrictions on communication and randomness, languages in NP. We extended the restricted model to an alternating sequence of k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collapsing degrees in subexponential time

    Publication Year: 1994, Page(s):367 - 382
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1056 KB)

    We show that there are subexponential deterministic time classes that have collapsing degrees. In particular, we prove the following: Let t be any effectively superpolynomial time bound. Then there is a set A∈DTIME(t) such that every set B∈degmp(A) is p-isomorphic to A View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time, hardware, and uniformity

    Publication Year: 1994, Page(s):176 - 185
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (700 KB)

    We describe three orthogonal complexity measures: parallel time, amount of hardware, and degree of non-uniformity, which together parametrize most complexity classes. We show that the descriptive complexity framework neatly captures these measures using the parameters: quantifier depth, number of variable bits, and type of numeric predicates respectively. A fairly simple picture arises in which th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using bounded query classes to separate classes in the exponential time hierarchy from classes in PH

    Publication Year: 1994, Page(s):53 - 58
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (488 KB)

    We are interested in separating classes in the exponential time hierarchy, EXPH, from classes in the polynomial time hierarchy, PH. We show that for any fixed integer c, PNP[O(n(c)])⊆NEXP. This improves a previous result by B. Fu, H. Li and Y. Zhong (1992). Further, we generalize this separation to related levels of PH and EXPH, showing that for any fixed integer c and i⩾1, &De... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A direct product theorem

    Publication Year: 1994, Page(s):88 - 96
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (676 KB)

    Gives a general setting in which the complexity (or quality) of solving two independent problems is the product of the associated individual complexities. The authors then derive from this setting several concrete results of this type for decision trees and communication complexity View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random strings make hard instances

    Publication Year: 1994, Page(s):217 - 222
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (396 KB)

    We establish the truth of the “instance complexity conjecture” in the case of DEXT-complete sets w.r.t. polynomial time computations, and r.e. complete sets w.r.t. recursive computations. Specifically, we obtain for every DEXT-complete set A an exponentially dense subset C such that for every nondecreasing polynomial t(n)=ω(n log n), ict(x:A)⩾Kt(x)-c hol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial time truth-table reductions to p-selective sets

    Publication Year: 1994, Page(s):24 - 30
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (552 KB)

    We make an elaborate analysis of the intervals defined by the ordered list of queries to the p-selective set. It turns out that the properties we derive are strong enough to get a collapse to P for several complexity classes, assuming that they are quasi-linear truth-table reducible (or in some cases o(logn)-tt reducible) to a p-selective set. More specifically, for any class 𝒦∈{NP, PP, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relationships among PL, #L, and the determinant

    Publication Year: 1994, Page(s):267 - 278
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (872 KB)

    Results by Toda (1991), Vinay (1991), Damm (1991), and Valiant (1992) have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computations of a nondeterministic logspace-bounded machine. (This class of functions is known as L.) By using that characterization and by establishing a few elementary closure properties, we give a very simp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the isomorphism problem for weak reducibilities

    Publication Year: 1994, Page(s):338 - 355
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1616 KB)

    The isomorphism conjecture states that all NP-complete sets are polynomial-time isomorphic while the encrypted complete set conjecture states that there is a p-one-way function f and an NP-complete set A such that A and f(A) are not polynomial-time isomorphic. We investigate these two conjectures for reducibilities weaker than polynomial-time. We show that: 1. Relative to reductions computed by on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weakly hard problems

    Publication Year: 1994, Page(s):146 - 161
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (880 KB)

    A weak completeness phenomenon is investigated in the complexity class E=DTIME(2linear). According to standard terminology, a language H is ⩽mP-hard for E if the set Pm(H), consisting of all languages A⩽mP H, contains the entire class E. A language C is ⩽m P-complete for E if it is ⩽m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructive separation of classes of indistinguishable ensembles

    Publication Year: 1994, Page(s):198 - 204
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (468 KB)

    We construct ensembles that separate the classes of algorithmically, circuit, statistically, and perfect indistinguishable ensembles without cryptographic assumptions and present a generally usable technique for efficient deterministic simulation of resource bounded probabilistic Turing machines View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of optimal queueing network control

    Publication Year: 1994, Page(s):318 - 322
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (516 KB)

    We consider the classical problem of optimal control (routing and sequencing) of a network of queues. We prove that this problem is EXP-complete and, therefore, provably intractable. Similar results are established for restricted versions of the problem. A weaker result is also established for the restless bandit problem View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Downward separation fails catastrophically for limited nondeterminism classes

    Publication Year: 1994, Page(s):134 - 138
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (368 KB)

    The β hierarchy consists of sets βk=NP[log k n]⊆NP. Unlike collapses in the polynomial hierarchy and the Boolean hierarchy, collapses in the β hierarchy do not seem to translate up, nor does closure under complement seem to cause the hierarchy to collapse. For any consistent set of collapses and separations of levels of the hierarchy that respects P=β... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.