Scheduled System Maintenance
On Friday, September 21, IEEE Xplore will undergo scheduled maintenance. Users may experience intermittent access from 2:30–4:00 pm ET (6:30–8:00 UTC). The site may be unavailable for approximately 60 minutes during this period.
We apologize for any inconvenience.

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)

6-6 May 1999

Filter Results

Displaying Results 1 - 25 of 32
  • Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (187 KB)
    Freely Available from IEEE
  • Short proofs are narrow-resolution made simple

    Publication Year: 1999
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (26 KB)

    We develop a general strategy for proving width lower bounds, which follows Haken's original proof technique but is now simple and clear. It reveals that large width is implied by certain natural expansion properties of the clauses (axioms) of the tautology in question. We show that in the classical examples of the Pigeonhole principle, Tseitin graph tautologies, and random k-CNFs, these expansion... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the complexity of diophantine geometry in low dimensions

    Publication Year: 1999
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, we show that the following two problems can be solved within PSPACE: I. Given polynomials f/sub 1/,...,f/sub m//spl isin/Z[x/sub 1/,...,x/sub n/] defining a variety of dimension /spl les/0 in C/sup n/, find all solutions in Z/sup n/ of f/sub 1/=/spl middot//spl middot//spl middot/=f/... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pseudorandom generators without the XOR lemma

    Publication Year: 1999
    Cited by:  Papers (29)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (20 KB)

    Summary form only given. R. Impagliazzo and A. Wigderson (1997) have recently shown that if there exists a decision problem solvable in time 2/sup O(n)/ and having circuit complexity 2/sup /spl Omega/(n)/ (for all but finitely many n) then P=BPP. This result is a culmination of a series of works showing connections between the existence of hard predicates and the existence of good pseudorandom gen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear gaps between degrees for the polynomial calculus modulo distinct primes

    Publication Year: 1999
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (22 KB)

    Two important algebraic proof systems are the Nullstellensatz system and the polynomial calculus (also called the Grobner system). The Nullstellensatz system is a propositional proof system based on Hilbert's Nullstellensatz, and the polynomial calculus (PC) is a proof system which allows derivations of polynomials, over some field. The complexity of a proof in these systems is measured in terms o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph Ramsey theory and the polynomial hierarchy

    Publication Year: 1999
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (15 KB)

    Summary form only given, as follows. In the Ramsey theory of graphs F/spl rarr/(G, H) means that for every way of coloring the edges of F red and blue F will contain either a red G or a blue H as a subgraph. The problem ARROWING of deciding whether F/spl rarr/(G, H) lies in /spl Pi//sub 2//sup P/=coNP/sup NP/ and it was shown to be coNP-hard by S.A. Burr (1990). We prove that ARROWING is actually ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The communication complexity of pointer chasing. Applications of entropy and sampling

    Publication Year: 1999
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (38 KB)

    The following pointer chasing problem plays a central role in the study of bounded round communication complexity. There are two players A and B. There are two sets of vertices V/sub A/ and V/sub B/ of size n each. Player A is given a function f/sub A/: VA/spl rarr/VB and player B is given a function f/sub B/: VB/spl rarr/VA. In the problem g/sub k/ the players have to determine the vertex reached... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound for primality

    Publication Year: 1999, Page(s):10 - 14
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (167 KB)

    Recent work by Bernasconi, Damm and Shparlinski proved lower bounds on the circuit complexity of the square-free numbers, and raised as an open question if similar (or stronger) lower bounds could be proved for the set of prime numbers. In this short note, we answer this question affirmatively, by showing that the set of prime numbers (represented in the usual binary notation) is not contained in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-automatizability of bounded-depth Frege proofs

    Publication Year: 1999, Page(s):15 - 23
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (171 KB)

    In this paper; we show how to extend the argument due to Bonet, Pitassi and Raz to show that bounded-depth Frege proofs do not have feasible interpolation, assuming that factoring of Blum integers or computing the Diffie-Hellman function is sufficiently hard. It follows as a corollary that bounded-depth Frege is not automatizable; in other words, there is no deterministic polynomial-time algorithm... View full abstract»

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

    Publication Year: 1999, Page(s):24 - 31
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (123 KB)

    In this paper we show several results about monotone planar circuits. We show that monotone planar circuits of bounded width, with access to negated input variables, compute exactly the functions in non-uniform AC/sup 0/. This provides a striking contrast to the non-planar case, where exactly NC/sup 1/ is computed. We show that the circuit value problem for monotone planar circuits, with inputs on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing from partial solutions

    Publication Year: 1999, Page(s):34 - 45
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (227 KB)

    We consider the question: Is finding just a part of a solution easier than finding the full solution? For example, is finding only an /spl epsiv/ fraction of the bits in a satisfying assignment to a 3-CNF formula easier than computing the whole assignment? For several important problems in NP we show that obtaining only a small fraction of the solution is as hard as finding the full solution. This... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proofs, codes, and polynomial-time reducibilities

    Publication Year: 1999, Page(s):46 - 53
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (140 KB)

    We show how to construct proof systems for NP languages where a deterministic polynomial-time verifier can check membership, given any N/sup (2/3)+/spl epsi// bits of an N-bit witness of membership. We also provide a slightly superpolynomial time proof system where the verifier can check membership, given only N/sup (1/2)+/spl epsi// bits of an N-bit witness. These pursuits are motivated by the wo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparing entropies in statistical zero knowledge with applications to the structure of SZK

    Publication Year: 1999, Page(s):54 - 73
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (370 KB)

    We consider the following (promise) problem, denoted ED (for Entropy Difference): The input is a pair of circuits, and YES instances (resp., NO instances) are such pairs in which the first (resp., second) circuit generates a distribution with noticeably higher entropy. On one hand we show that any language having a (honest-verifier) statistical zero-knowledge proof is Karp-reducible to ED. On the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • De-randomizing BPP: the state of the art

    Publication Year: 1999, Page(s):76 - 77
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (67 KB)

    The introduction of randomization into efficient computation has been one of the most fertile and useful ideas in computer science. In cryptography and asynchronous computing, randomization makes possible tasks that are impossible to perform deterministically. Even for function computation, many examples are known in which randomization allows considerable savings in resources like space and time ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of solving equations over finite groups

    Publication Year: 1999, Page(s):80 - 86
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    We study the computational complexity of solving systems of equations over a finite group. An equation over a group G is an expression of the form w/sub 1//spl middot/w/sub 2//spl middot//spl middot//spl middot//spl middot//spl middot/w/sub k/=id where each w/sub i/ is either a variable, an inverted variable, or group constant and id is the identity element of G. A solution to such an equation is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Depth-3 arithmetic formulae over fields of characteristic zero

    Publication Year: 1999, Page(s):87 - 96
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    In this paper we prove near quadratic lower bounds for depth-3 arithmetic formulae over fields of characteristic zero. Such bounds are obtained for the elementary symmetric functions, the (trace of) iterated matrix multiplication, and the determinant. As corollaries we get the first non-trivial lower bounds for computing polynomials of constant degree, and a gap between the power depth-3 arithmeti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stronger separations for random-self-reducibility, rounds, and advice

    Publication Year: 1999, Page(s):98 - 104
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (114 KB)

    A function f is self-reducible if it can be computed given an oracle for f. In a random-self-reduction the queries must be made in such a way that the distribution of the ith query is independent of the input that gave rise to it. Random-self-reductions have many applications, including countless cryptographic protocols, probabilistically checkable proofs, average-case complexity, and program chec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The expected size of Heilbronn's triangles

    Publication Year: 1999, Page(s):105 - 113
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    Heilbronn's triangle problem asks for the least /spl Delta/ such that n points lying in the unit disc necessarily contain a triangle of area at most /spl Delta/. Heilbronn initially conjectured /spl Delta/=O(1/n/sup 2/). As a result of concerted mathematical effort it is currently known that there are positive constants c and C such that c log n/n/sup 2//spl les//spl Delta//spl les/C/n/sup 8/7-/sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Upper semilattice of binary strings with the relation "x is simple conditional to y"

    Publication Year: 1999, Page(s):114 - 122
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    In this paper we construct a structure R that is a "finite version" of the semilattice of Turing degrees. Its elements are strings (technically, sequences of strings) and x/spl les/y means that K(x|)=(conditional Kolmogorov complexity of x relative to y) is small. We construct two elements in R that do not have greatest lower bound. We give a series of examples that show how natural algebraic cons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gaps in bounded query hierarchies

    Publication Year: 1999, Page(s):124 - 141
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (254 KB)

    Prior results show that most bounded query hierarchies cannot contain finite gaps. For example, it is known that P/sub (m+1)-tt//sup SAT/=P/sub m-tt//sup SAT//spl rArr/P/sub btt//sup SAT/=P/sub m-tt//sup SAT/ and for all sets A/spl middot/FP/sub (m=1)-tt//sup A/=FP/sub m-tt//sup A//spl rArr/FP/sub btt//sup A/=FP/sub m-tt//sup A//spl middot/P/sub (m+1)-T//sup A/=P/sub m-T//sup A/=P/sub bT//sup A//s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query order and NP-completeness

    Publication Year: 1999, Page(s):142 - 148
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (197 KB)

    The effect of query order on NP-completeness is investigated. A sequence D/spl I.oarr/=(D/sub 1/,...,D/sub k/) of decision problems is defined to be sequentially complete for NP if each D/sub i//spl isin/NP and every problem in NP can be decided in polynomial time with one query to each of D/sub 1/,...,D/sub k/ in this order. It is shown that, if NP contains a language that is p-generic in the sen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum bounded query complexity

    Publication Year: 1999, Page(s):149 - 156
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (153 KB)

    We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query, complexity of decision problems. Under traditional complexity assumptions, we obtain an exponential speedup between the quantum and the classical query complexity of function clas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some recent progress on the complexity of lattice problems

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

    We survey some recent developments in the study of the complexity of lattice problems. After a discussion of some problems on lattices which can be algorithmically solved efficiently, our main focus is the recent progress on complexity results of intractability. We discuss Ajtai's worst-case/average-case connections, NP-hardness and non-NP-hardness, transference theorems between primal and dual la... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum simulations of classical random walks and undirected graph connectivity

    Publication Year: 1999, Page(s):180 - 187
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    There are a number of questions in quantum complexity that have been resolved in the time-bounded setting, but remain open in the space-bounded setting. For example, it is not currently known if space-bounded probabilistic computations can be simulated by space-bounded quantum machines without allowing measurements during the computation, while it is known that an analogous statement holds in the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic amplification of space-bounded probabilistic algorithms

    Publication Year: 1999, Page(s):188 - 198
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (207 KB)

    This paper initiates the study of deterministic amplification of space-bounded probabilistic algorithms. The straightforward implementations of known amplification methods cannot be used for such algorithms, since they consume too much space. We present a new implementation of the Ajtai-Komlos-Szemeredi method, that enables to amplify an S-space algorithm that uses r random bits and errs with prob... View full abstract»

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