Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)

24-27 May 1996

Filter Results

Displaying Results 1 - 25 of 32
  • Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (831 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (43 KB)
    Freely Available from IEEE
  • Much ado about functions

    Publication Year: 1996, Page(s):198 - 212
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1120 KB)

    This paper surveys basic results on complexity classes of partial multivalued functions. We stress basic inclusion relations, interesting hierarchies, and results that demonstrate that hierarchies are extant View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Truth-table closure and Turing closure of average polynomial time have different measures in EXP

    Publication Year: 1996, Page(s):190 - 195
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    Let PP-comp denote the sets that are solvable in polynomial time on average under every polynomial time computable distribution on the instances. In this paper we show that the truth-table closure of PP-comp has measure 0 in EXP. Since, as we show, EXP is Turing reducible to PP-comp, the Turing closure has measure 1 in EXP and thus, PP-comp is an example... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The law of the iterated logarithm for random sequences

    Publication Year: 1996, Page(s):180 - 189
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    The stochastic properties of p-random sequences are studied in this paper. It is shown that the law of the iterated logarithm holds for p-random sequences. This law gives a quantitative characterization of the density of p-random sets. When combined with the invariance property of p-random sequences, this law is also useful in proving that some complexity classes have p-measure 0 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integer programming as a framework for optimization and approximability

    Publication Year: 1996, Page(s):249 - 259
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    Structural approximation theory seeks to provide a framework for expressing optimization problems, and isolating structural or syntactic conditions that explain the (apparent) difference in the approximation properties of different NP-optimization problems. In this paper, we initiate a study of structural approximation using integer programming (an optimization problem in its own right) as a gener... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of weak completeness notions

    Publication Year: 1996, Page(s):171 - 178
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    We compare the weak completeness notions for E in the sense of Lutz's resource-bounded measure theory (1992) with respect to the standard polynomial time reducibilities. Our results parallel results for classical completeness by Watanabe (1987) and others. We show that the weak completeness notions for 1-query reductions coincide: A set is weakly complete for E under 1-truth-table reducibility iff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error reduction by parallel repetition-a negative result

    Publication Year: 1996, Page(s):70 - 76
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    We show that no fixed number of parallel repetitions suffices in order to reduce the error in two-prover one-round proof systems from one constant to another. Our results imply that the recent bounds proven by Ran Raz (1995), showing that the number of rounds that suffice is inversely proportional to the answer length, are nearly best possible View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on decision versus search for graph automorphism

    Publication Year: 1996, Page(s):272 - 277
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    We show that for any graph G, k non-trivial automorphisms of G-if as many exist-can be computed in time |G|O(log k) with nonadaptive queries to GA, the decision problem for Graph Automorphism. As a consequence we show that some problems related to GA and GI are polynomial-time truth-table equivalent to GA View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VC dimension in circuit complexity

    Publication Year: 1996, Page(s):81 - 85
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    The main result of this paper is a Ω(n1/4) lower bound on the size of a sigmoidal circuit computing a specific AC2 0 function. This is the first lower bound for the computation model of sigmoidal circuits with unbounded weights. We also give upper and lower bounds for the same function in a few other computation models: circuits of AND/OR gates, threshold cir... View full abstract»

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

    Publication Year: 1996, Page(s):97 - 106
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    Properties of L-printable sets are considered, and it is shown that two sets A and B that are L-printable and have similar density are L-isomorphic. L-printable sets are characterized as those sets L-isomorphic to tally sets in L, and as subsets of KS[k log n, k log n]. Several classes of L-printable sets are given, including sparse regular and context-free sets; a characterization of sparse regul... View full abstract»

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

    Publication Year: 1996, Page(s):244 - 248
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    Representing knowledge in forms appropriate for rapid common-sense reasoning is a challenging current problem in artificial intelligence. We review certain recent results which suggest that complexity theory has an important role to play in this field View full abstract»

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

    Publication Year: 1996, Page(s):162 - 170
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    Continuing a line of research opened up by Grigni and Sipser (1992) and further pursued by Stewart (1994), we show that a wide variety of equivalent characterizations of P still remain equivalent when restricted to be positive. All these restrictions thus define the same class posP, a proper subclass of monP, the class of monotone problems in P. We also exhibit complete problems for posP under ver... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On coherence, random-self-reducibility, and self-correction

    Publication Year: 1996, Page(s):59 - 67
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    We address two questions about self-reducibility-the power of adaptiveness in examiners that take advice and the relationship between random-self-reducibility and self-correctability. We first show that adaptive examiners are more powerful than nonadaptive examiners, even if the nonadaptive ones are nonuniform. Blum et al. (1993) showed that every random-self-reducible function is self-correctable... View full abstract»

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

    Publication Year: 1996, Page(s):213 - 222
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    We look at the hypothesis that all honest onto polynomial-time computable functions have a polynomial-time computable inverse. We show this hypothesis equivalent to several other complexity conjectures including: One can find accepting paths of nondeterministic polynomial-time Turing machines that accept Σ*. Every total multivalued nondeterministic function has a polynomial-time computable r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complements of multivalued functions

    Publication Year: 1996, Page(s):260 - 269
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    We study the class coNPMV of complements of NPMV functions. Though defined symmetrically to NPMV this class exhibits very different properties. We clarify the complexity of coNPMV by showing that it is essentially the same as that of NPMVNP complete functions for coNPMV are exhibited and central complexity-theoretic properties of this class are studied. We show that computing maximum sa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An isomorphism theorem for circuit complexity

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

    We show that all sets complete for NC1 under AC0 reductions are isomorphic under AC0-computable isomorphisms. Although our proof does not generalize directly to other complexity classes, we do show that, for all complexity classes C closed under NC1-computable many-one reductions, the sets complete for C under NC0 reductions are all isomorphi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deciding the Vapnik-Cervonenkis dimension is Σ3 p-complete

    Publication Year: 1996, Page(s):77 - 80
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    Linial et al. (1988) raised the question of how difficult the computation of the Vapnik-Cervonenkis dimension of a concept class over a finite universe is. Papadimitriou and Yannakakis (1993) obtained a first answer using matrix representations of concept classes. However, this approach does not capture classes having exponential size, like monomials, which are encountered in learning theory. We c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero knowledge and the chromatic number

    Publication Year: 1996, Page(s):278 - 287
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    We present a new technique, inspired by zero-knowledge proof systems, for proving lower bounds on approximating the chromatic number of a graph. To illustrate this technique we present simple reductions from max-3-coloring and max-3-sat, showing that it is hard to approximate the chromatic number within Ω(Nδ), for some δ>0. We then apply our technique in conjunction... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing P to a sparse set using a constant number of queries collapses P to L

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

    We prove that there is no sparse hard set for P under logspace computable bounded truth-table reductions unless P=L. In case of reductions computable in NC1, the collapse goes down to P=NC 1. We generalize this result by parameterizing the sparseness condition, the space bound and the number of queries of the reduction, apply the proof technique to NL and L, and extend all th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchies of circuit classes that are closed under complement

    Publication Year: 1996, Page(s):108 - 117
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    We examine three hierarchies of circuit classes and show they are closed under complementation. (1) The class of languages recognized by a family of polynomial size skew circuits with width O(w), are closed under complement. (2) The class of languages recognized by family of polynomial size circuits with width O(w) and polynomial tree-size, are closed under complement. (3) The class of languages r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on p-selective sets and on adaptive versus nonadaptive queries to NP

    Publication Year: 1996, Page(s):224 - 232
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    We study two properties of a complexity class C-whether there exists a truth-table hard p-selective language for C, and whether polynomially-many nonadaptive queries to C can be answered by making O(log n)-many adaptive queries to C (in symbols, is PFttC⊆PFC[O(log n)]). We show that if there exists an NP-hard p-selective set under truth-table reductions, then ... View full abstract»

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

    Publication Year: 1996, Page(s):12 - 21
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    We define the counting classes NC1, GapNC1 PNC1 and C=NC1. We prove that Boolean circuits, algebraic circuits, programs over nondeterministic finite automata, and programs over constant integer matrices yield equivalent definitions of the latter three classes. We investigate closure properties. We observe that NC1⊆L and that C<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DNA models and algorithms for NP-complete problems

    Publication Year: 1996, Page(s):290 - 300
    Cited by:  Papers (15)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    A goal of research on DNA computing is to solve problems that are beyond the capabilities of the fastest silicon-based supercomputers. Adleman and Lipton present exhaustive search algorithms for 3Sat and 3-Coloring, which can only be run on small instances and hence are not practical. In this paper, we show how improved algorithms can be developed for the 3-Coloring and Independent Set problems. O... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Succinct representation, leaf languages, and projection reductions

    Publication Year: 1996, Page(s):118 - 126
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    The concepts of succinct problem representation, and of NP leaf languages, were developed to characterize complexity classes above polynomial time. Here, we work out a descriptive complexity approach to succinctly represented problems, and prove a strictly stronger version of the Conversion Lemma from Balcazar et al (1992) which allows iterated application. Moreover, we prove that for every proble... View full abstract»

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