Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.

24-24 June 2004

Filter Results

Displaying Results 1 - 25 of 40
  • Proceedings. 19th IEEE Annual Conference on Computational Complexity

    Publication Year: 2004
    Request permission for commercial reuse | PDF file iconPDF (210 KB)
    Freely Available from IEEE
  • Proceedings 19th IEEE Annual Conference on Computational Complexity

    Publication Year: 2004, Page(s): ii
    Request permission for commercial reuse | PDF file iconPDF (161 KB)
    Freely Available from IEEE
  • Proceedings 19th IEEE Annual Conference on Computational Complexity

    Publication Year: 2004, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (182 KB)
    Freely Available from IEEE
  • Copyright page

    Publication Year: 2004, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (188 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2004, Page(s):v - vii
    Request permission for commercial reuse | PDF file iconPDF (188 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2004, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (169 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committees

    Publication Year: 2004, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (166 KB)
    Freely Available from IEEE
  • Awards

    Publication Year: 2004, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (165 KB)
    Freely Available from IEEE
  • 10th anniversary ECCC-the electronic colloquium on computational complexity

    Publication Year: 2004, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (185 KB)
    Freely Available from IEEE
  • Compression of samplable sources

    Publication Year: 2004, Page(s):1 - 14
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    We study the compression of polynomially samplable sources. In particular, we give efficient prefix-free compression and decompression algorithms for three classes of such sources (whose support is a subset of {0, l}/sup n/). 1) We show how to compress sources X samplable by logspace machines to expected length H(X) + O(1). Our next results concern flat sources whose support is in P. 2) If H(X) /s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Language compression and pseudorandom generators

    Publication Year: 2004, Page(s):15 - 28
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1105 KB) | HTML iconHTML

    The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given a membership oracle for A. We study randomized and nondeterministic decompression schemes and investigate how close we can get to the information theoretic lower bound of log /spl par/A/sup = n//spl par/ for the descript... View full abstract»

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

    Publication Year: 2004, Page(s):29 - 41
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1273 KB) | HTML iconHTML

    A source is comprehensible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high pseudo-entropy if it is computationally distinguishable from a source of high entropy. In this paper, we present a technique for proving lower bounds on compressibility in an oracle setting, which yields the following res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reductions between disjoint NP-pairs

    Publication Year: 2004, Page(s):42 - 53
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (387 KB) | HTML iconHTML

    Razborov (1994) proved that existence of an optimal proof system implies existence of a many-one complete disjoint NP-pair. Kobler, Messner, and Toran (2003) defined a stronger form of many-one reduction and claimed to improve Razborov's result by showing under the same assumption that there is a strongly many-one complete disjoint NP-pair. Here we show that the two results are equivalent. More ge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relativized NP search problems and propositional proof systems

    Publication Year: 2004, Page(s):54 - 67
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (509 KB) | HTML iconHTML

    An NP search problem is the problem of finding a witness to a given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses containing natural problems; for example, PLS is the class of efficient local search heuristics. These classes are characterized by the combinatorial principle that guarantees the existence of a solution; for example, PLS is the c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of treelike systems over /spl lambda/-local formulae

    Publication Year: 2004, Page(s):68 - 74
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (618 KB) | HTML iconHTML

    We describe a system LK(c[/spl lambda/]) for refuting CNF formulae, as a restriction of the sequent calculus in which every formula in a sequent is defined over at most /spl lambda/ variables. This further generalizes the system Res(k), a generalization of Resolution to k-DNF introduced in (Krajicek, 2001). We adapt the Pudlak-Impagliazzo game (Pudlak and Impagliazzo, 2000) to prove lower bounds f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds for testing bipartiteness in dense graphs

    Publication Year: 2004, Page(s):75 - 81
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (337 KB) | HTML iconHTML

    We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and graphs that are /spl epsi/-far from bipartite using 0(1//spl epsi//sup 2/) queries. We show that this is optimal for non-adaptive algorithms, up to polylogarithmic factors. We also show a lower bound of /spl Omega/(1//spl ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy

    Publication Year: 2004, Page(s):82 - 90
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (318 KB) | HTML iconHTML

    It is known (Boppana et a;., 1987) that if every language in coNP has a constant-round interactive proof system, then the polynomial hierarchy collapses. On the other hand, Lund et al. (1992) have shown that #SAT, the #P-complete function that outputs the number of satisfying assignments of a Boolean formula, can be computed by a linear-round interactive protocol. As a consequence, the coNP-comple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solvable group isomorphism is (almost) in NP /spl cap/ CoNP

    Publication Year: 2004, Page(s):91 - 103
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (438 KB) | HTML iconHTML

    The group isomorphism problem consists in deciding whether two input groups G/sup 1/ and G/sup 2/ given by their multiplication tables are isomorphic. We first give a 2-round Arthur-Merlin protocol for the group non-isomorphism problem such that on input groups (G/sup 1/, G/sup 2/) of size n, Arthur uses O(log/sup 6/ n) random bits and Merlin uses O(log/sup 2/ n) nondeterministic bits. We derandom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Small spans in scaled dimension

    Publication Year: 2004, Page(s):104 - 112
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB) | HTML iconHTML

    Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time, either the class of languages reducible to A (the lower span) or the class of problems to which A can be reduced (the upper span) is small in the sense of resource-bounded measure and, in particular, that the degree of A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing in fault tolerance broadcast networks

    Publication Year: 2004, Page(s):113 - 122
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (499 KB) | HTML iconHTML

    We consider a fault tolerance broadcast network of n processors each holding one bit of information. The goal is to compute a given Boolean function on the n bits. In each step, a processor may broadcast one bit of information. Each listening processor receives the bit that was broadcasted with error probability bounded by a fixed constant /spl epsi/. The errors in different steps, as well as for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some results on majority quantifiers over words

    Publication Year: 2004, Page(s):123 - 129
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (321 KB) | HTML iconHTML

    The class of languages definable by majority quantifiers using the order predicate is investigated. It is shown that the additional use of first order or counting quantifiers does not increase this class. Further on, addition is in this connection a definable numerical predicate, while the converse does not hold. The emptiness problem for this class turns out to be undecidable. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Separating complexity classes using structural properties

    Publication Year: 2004, Page(s):130 - 138
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (350 KB) | HTML iconHTML

    We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S /spl isin/ P, A - S is still complete, where f(n) ranges from log(n), polynomial, to subexponential. We show that robustness can be used to separate complexity classes: For every /spl les//sub m//sup p/-complete set A for EXP and any subexponential dense sets S /spl isin/... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parameterized complexity of constraint satisfaction problems

    Publication Year: 2004, Page(s):139 - 149
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (373 KB) | HTML iconHTML

    We prove a parameterized analog of Schaefer's Dichotomy Theorem: we show that for every finite Boolean constraint family F, deciding whether a formula containing constraints from F has a satisfying assignment of weight exactly k is either fixed-parameter tractable (TPT,) or W[l]-complete. We give a simple characterization of those constraints that make the problem fixed-parameter tractable. The sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tight lower bounds for certain parameterized NP-hard problems

    Publication Year: 2004, Page(s):150 - 160
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB) | HTML iconHTML

    Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by proving a general result, namely that the parameterized weighted satisfiability problem on depth-t circuits cannot be solved in time n/sup o(k)/poly(m), where n is the circuit input length, m is the circuit size, and k is t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of the covering radius problem on lattices and codes

    Publication Year: 2004, Page(s):161 - 173
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (410 KB) | HTML iconHTML

    We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear codes. We also investigate the computational complexity of the shortest linearly independent vectors problem, and its relation to the covering radius problem for lattices. For the covering radius on n-dimensional lattices, w... View full abstract»

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