Proceedings of Computational Complexity. Twelfth Annual IEEE Conference

24-27 June 1997

Filter Results

Displaying Results 1 - 25 of 33
  • Proceedings of Computational Complexity. Twelfth Annual IEEE Conference

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

    Publication Year: 1997, Page(s): 315
    Request permission for commercial reuse | PDF file iconPDF (54 KB)
    Freely Available from IEEE
  • LR(k) testing is average case complete

    Publication Year: 1997, Page(s):74 - 80
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    In this note, we show that LR(k) testing of context free grammars with respect to random instances is many-one complete for Distributional NP. The same result holds for testing whether a context free grammar is LL(k), strong LL(k), SLR(k), LC(k) or strong LC(k), respectively View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Circuit bottom fan-in and computational power

    Publication Year: 1997, Page(s):158 - 164
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    We investigate the relationship between circuit bottom fan-in and circuit size when circuit depth is fixed. We show that in order to compute certain functions, a moderate reduction in circuit bottom fan-in will cause significant increase in circuit size. In particular, we prove that there are functions that are computable by circuits of linear size and depth k with bottom fan-in 2 but require expo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on universal distributions for polynomial-time computable distributions

    Publication Year: 1997, Page(s):69 - 73
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    Polynomial-time computable as well as polynomial-time samplable distributions play a central role in the theory of average-case complexity. It is known that for every constant k there are polynomial-time samplable distributions which dominate every distribution that is samplable in time O(nk). The result is based on the fact that there exists an enumeration of the O(nk)-time ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Upper and lower bounds for some depth-3 circuit classes

    Publication Year: 1997, Page(s):149 - 157
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    We investigate the complexity of depth-3 threshold circuits with majority gates at the output, possibly negated AND gates at level two, and MODm gates at level one. We show that the fan-in of the AND gates can be reduced to O(log n) in the case where m is unbounded, and to a constant in the case where m is constant. We then use these upper bounds to derive exponential lower bounds for t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial vicinity circuits and nonlinear lower bounds

    Publication Year: 1997, Page(s):61 - 68
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial in t of some degree k. We prove that such circuits require size Ω(n1+1k//log n) to compute several natural families of functions, including sorting, finite field arithmetic, and the “rigid linear tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tight bound on Johnson's algorithm for Max-SAT

    Publication Year: 1997, Page(s):274 - 281
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    We present a new technique that gives a more thorough analysis on Johnson's classical algorithm for the maximum satisfiability problem. In contrast to the common belief for two decades that Johnson's algorithm has performance ratio 1/2, we show that the performance ratio is 2/3, and that this bound is tight. Moreover we show that simple generalizations of Johnson's algorithm do not improve the per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomized simultaneous messages: solution of a problem of Yao in communication complexity

    Publication Year: 1997, Page(s):239 - 246
    Cited by:  Papers (8)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    We solve a 17 year old problem of A.C.C. Yao (1979). In the two-player communication model introduced by Yao in 1979, Alice and Bob wish to collaboratively evaluate a function f(x,y) in which Alice knows only input x and Bob knows only input y. Both players have unlimited computational power. The objective is to minimize the amount of communication. Yao (1979) also introduced an oblivious version ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On TC0, AC0, and arithmetic circuits

    Publication Year: 1997, Page(s):134 - 148
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1112 KB)

    Continuing a line of investigation that has studied the function classes P, we study the class of functions AC0. One way to define AC0 is as the class of functions computed by constant-depth polynomial-size arithmetic circuits of unbounded fanin addition and multiplication gates. In contrast to the preceding function classes, for which we know no nontrivial lower bounds, lowe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Six hypotheses in search of a theorem

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

    We consider the following six hypotheses: *P=NP. *SAT is truth-table reducible to a P-selective set. *SAT is truth-table reducible to a k-approximable set for some k. *FP||NP =FPNP[log] *SAT is O(log n)-approximable. *Solving SAT is in P on formulae with at most one assignment. We discuss their importance and relationships among them View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nondeterministic polynomial time versus nondeterministic logarithmic space: time-space tradeoffs for satisfiability

    Publication Year: 1997, Page(s):52 - 60
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that S¯A¯T¯ cannot be solved simultaneously in n1+0(1) time and n1-ε space for any ε>0 on general random-access nondeterministic Turing machines. We also give several other related results. Our proof uses two basic ideas. First we show that if S&... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hyper-polynomial hierarchies and the NP-jump

    Publication Year: 1997, Page(s):102 - 110
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    Assuming that the polynomial hierarchy (PH) does not collapse, we show the existence of ascending sequences of ptime Turing degrees of length ω1CK all of which are in PSPACE and uniformly hard for PH, such that successors are NP-jumps of their predecessors. This is analogous to the hyperarithmetic hierarchy which is defined similarly but with the (recursive) Turing degr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A short guide to approximation preserving reductions

    Publication Year: 1997, Page(s):262 - 273
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1012 KB)

    Comparing the complexity of different combinatorial optimization problems has been an extremely active research area during the last 23 years. This has led to the definition of several approximation preserving reducibilities and to the development of powerful reduction techniques. We first review the main approximation preserving reducibilities that have appeared in the literature and suggest whic... View full abstract»

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

    Publication Year: 1997, Page(s):226 - 238
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1188 KB)

    This paper concerns two fundamental but somewhat neglected issues both related to the design and analysis of randomized online algorithms. Motivated by early results in game theory we define several types of randomized online algorithms discuss known conditions for their equivalence and give a natural example distinguishing between two kinds of randomizations. In particular we show that mixed rand... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A nonadaptive NC checker for permutation group intersection

    Publication Year: 1997, Page(s):204 - 212
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    In this paper we design a nonadaptive NC checker for permutation group intersection, sharpening a result from M. Blum and S. Kannan (1995). This is a consequence of two results. First we show that a nontrivial permutation in the intersection of two given permutation groups (described by lists of generators) can be computed by an NC algorithm with one round of parallel queries to the group intersec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time bounded frequency computations

    Publication Year: 1997, Page(s):185 - 192
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    First we obtain two new results considering the inclusion problem of polynomial time frequency classes with equal numbers of errors: 1) (m, m+d) P⊇(m+1, m+d+1) P for m<2d; and 2) (m, m+d) P=(m+1, m+d+1) P for m⩾c(d) where c(d) is large enough. This disproves a conjecture of Kinber (1975). Next we give a transparent proof of a generalization of Kinber's result that there exis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite limits and monotone computations: the lower bounds criterion

    Publication Year: 1997, Page(s):302 - 313
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    Our main result is a combinatorial lower bounds criterion for monotone circuits over the reals. We allow any unbounded fanin non-decreasing real-valued functions as gates. The only requirement is their “locality”. Unbounded fanin AND and OR gates, as well as any threshold gate Tsm(x1,...,xm) with small enough threshold value min{s,m-s+1}, are... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Undecidability results for low complexity degree structures

    Publication Year: 1997, Page(s):128 - 132
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    We prove that the theory of EXPTIME degrees with respect to polynomial time Turing and many-one reducibility is undecidable. To do so we use a coding method based on ideal lattices of Boolean algebras which is introduced A. Nies. The method can be applied in fact to all hyper-polynomial time classes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reversible space equals deterministic space

    Publication Year: 1997, Page(s):45 - 50
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    This paper describes the simulation of an S(n) space-bounded deterministic Turing machine by a reversible Turing machine operating in space S(n). It thus answers a question posed by C. Bennett (1989) and refutes the conjecture, made by M. Li and P. Vitanyi (1996), that any reversible simulation of an irreversible computation must obey Bennett's reversible pebble game rules View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity and expressive power of logic programming

    Publication Year: 1997, Page(s):82 - 101
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1880 KB)

    This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results on plain logic programming (pure Horn clause programs), more recent results on various important ext... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound for perceptrons and an oracle separation of the PP PH hierarchy

    Publication Year: 1997, Page(s):165 - 172
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    We show that there are functions computable by linear size boolean circuits of depth k that require superpolynomial size perceptrons of depth k-1, for k<log n/(6 log log n). This result implies the existence of an oracle A such that Σkp,A⊄PPΣ(k-2 p,A) and in particular this oracle separates the levels in the PPPH... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraint satisfaction: the approximability of minimization problems

    Publication Year: 1997, Page(s):282 - 296
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1568 KB)

    This paper continues the work initiated by N. Creignou (1995) and S. Khanna et al. (1997) who classify maximization problems derived from Boolean constraint satisfaction. We study the approximability of minimization problems derived thence. A problem in this framework is characterized by a collection F of “constraints” (i.e., functions f: {0,1}k→{0,1}) and an instance o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The communication complexity of the universal relation

    Publication Year: 1997, Page(s):247 - 259
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (996 KB)

    Consider the following communication problem. Alice gets a word x∈{0,1}n and Bob gets a word y∈{0,1}n. Alice and Bob are told that x≠y. Their goal is to find an index 1⩽i⩽n such that xi≠yi (the index i should be known to both of them). This problem is one of the most basic communication problems. It arises naturally from the corre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inequalities for Shannon entropies and Kolmogorov complexities

    Publication Year: 1997, Page(s):13 - 23
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    Since the very beginning the notion of complexity of finite objects was considered as an algorithmic counterpart to the notion of Shannon entropy. Kolmogorov's paper (1965) was called “Three approaches to the quantitative definition of information”; Shannon entropy and algorithmic complexity were among these approaches. It was mentioned by Kolmogorov later (1968) that the properties of... View full abstract»

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