By Topic

Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on

Date 19-19 Nov. 2002

Filter Results

Displaying Results 1 - 25 of 82
  • Proceedings 43rd Annual IEEE Symposium on Foundations of Computer Science

    Publication Year: 2002
    Request permission for commercial reuse | PDF file iconPDF (327 KB)
    Freely Available from IEEE
  • Learning intersections and thresholds of halfspaces

    Publication Year: 2002, Page(s):177 - 186
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (389 KB) | HTML iconHTML

    We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution to within any constant error parameter. We also give the first quasipolynomial time algorithm for learning any function of a polylog number of polynomial-weight halfspaces under any distribution. As special cases of these results we obtain algorithms for learning inte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Erratum to "Vickrey pricing and shortest paths: What is an edge worth?"

    Publication Year: 2002, Page(s): 809
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB) | HTML iconHTML

    First Page of the Article
    View full abstract»

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

    Publication Year: 2002, Page(s):811 - 813
    Request permission for commercial reuse | PDF file iconPDF (177 KB)
    Freely Available from IEEE
  • PAC=PAExact and other equivalent models in learning

    Publication Year: 2002, Page(s):167 - 176
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1900 KB) | HTML iconHTML

    The probably almost exact model (PAExact) can be viewed as the exact model relaxed so that: 1. The counterexamples to equivalence queries are distributionally drawn rather than adversarially chosen. 2. The output hypothesis is equal to the target with negligible error (1/ω(poly) for any poly). This model allows studying (almost) exact learnability of infinite classes and is in some sense ana... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing with memory

    Publication Year: 2002, Page(s):799 - 808
    Cited by:  Papers (10)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (378 KB) | HTML iconHTML

    A standard load balancing model considers placing n balls into n bins by choosing d possible locations for each ball independently and uniformly at random and sequentially placing each in the least loaded of its chosen bins. It is well known that allowing just a small amount of choice (d = 2) greatly improves performance over random placement (d = 1). In this paper, we show that similar performanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Packing 2-dimensional bins in harmony

    Publication Year: 2002, Page(s):490 - 499
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (387 KB) | HTML iconHTML

    We consider 2-Dimensional (Finite) Bin Packing (2BP), which is one of the most important generalizations of the well-known Bin Packing (BP) and calls for orthogonally packing a given set of rectangles (that cannot be rotated) into the minimum number of unit size squares. There are many open questions concerning the approximability of 2BP, whereas the situation for the 2-stage case, in which the it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions

    Publication Year: 2002, Page(s):416 - 425
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (387 KB) | HTML iconHTML

    We consider the following class of problems. The value of an outcome to a society is measured via a submodular utility function (submodularity has a natural economic interpretation: decreasing marginal utility). Decisions, however, are controlled by non-cooperative agents who seek to maximise their own private utility. We present, under basic assumptions, guarantees on the social performance of Na... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An inverse-Ackermann style lower bound for the online minimum spanning tree verification problem

    Publication Year: 2002, Page(s):155 - 163
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    We consider the problem of preprocessing an edge-weighted tree T in order to quickly answer queries of the following type: does a given edge e belong in the minimum spanning tree of T ∪ {e}? Whereas the offline minimum spanning tree verification problem admits a lovely linear time solution, we demonstrate an inherent inverse-Ackermann type tradeoff in the online MST verification problem. In pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constant-round coin-tossing with a man in the middle or realizing the shared random string model

    Publication Year: 2002, Page(s):345 - 355
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB) | HTML iconHTML

    We present the first constant-round non-malleable commitment scheme and the first constant-round non-malleable zero-knowledge argument system, as defined by Dolev, Dwork and Naor (1991). Previous constructions either used a non-constant number of rounds, or were only secure under stronger setup assumptions. An example of such an assumption is the shared random string model where we assume all part... View full abstract»

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

    Publication Year: 2002, Page(s):761 - 765
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (422 KB) | HTML iconHTML

    There appears to be a gap between usual interpretations of Godel Theorem and what is actually proven. Closing this gap does not seem obvious and involves complexity theory. (This is unrelated to, well studied before, complexity quantifications of the usual Godel effects.) Similar problems and answers apply to other unsolvability results for tasks where required solutions are not unique, such as, e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent zero knowledge with logarithmic round-complexity

    Publication Year: 2002, Page(s):366 - 375
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB) | HTML iconHTML

    We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using O˜(log n) rounds of interaction. The number of rounds in our protocol is optimal, in the sense that any language outside BPP requires at least Ω˜(log n) rounds of interaction in order to be proved in black-box concurrent zero-knowledge. The zero-knowledge property of our main protocol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On random symmetric travelling salesman problems

    Publication Year: 2002, Page(s):789 - 798
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (542 KB) | HTML iconHTML

    Let the edges of the complete graph Kn be assigned independent uniform [0,1] random edge weights. Let ZTSP and Z2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor respectively. We show that whp1 |ZTSP-Z2FAC|=(1). The proof is via the analysis of a polynomial time algorithm that finds a tou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal system of loops on an orientable surface

    Publication Year: 2002, Page(s):627 - 636
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (932 KB) | HTML iconHTML

    Every compact orientable boundaryless surface ℳ can be cut along simple loops with a common point υ0, pairwise disjoint except at υ0, so that the resulting surface is a topological disk; such a set of loops is called a fundamental system of loops for ℳ. The resulting disk is a polygon in which the edges are pairwise identified on the surface; it is called ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Small induced-universal graphs and compact implicit graph representations

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

    We show that there exists a graph G with n · 2O(log* n) nodes, where any forest with n nodes is a node-induced subgraph of G. Furthermore, the result implies the existence of a graph with nk2O(log* n) nodes that contains all n-node graphs of fixed arboricity k as node-induced subgraphs. We provide a lower bound of Ω(nk) for the size of such ... View full abstract»

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

    Publication Year: 2002, Page(s):481 - 489
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its elements (adjacent edges) and the number of available copies of each set (vertex) is bounded. This is a natural generalization of the classical problems that also captures resource limitations in practical scenarios. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Auctions with severely bounded communication

    Publication Year: 2002, Page(s):406 - 415
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare-maximizing and revenue-maximizing auctions under this communication restriction. For both measures, we determine the optimal auction and show that the loss incurred relative to unconstrained auctions is mild. We prove unsurprising proper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implicit B-trees: New results for the dictionary problem

    Publication Year: 2002, Page(s):145 - 154
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (379 KB) | HTML iconHTML

    We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining n data values in the first n locations of an array in such a way that we can efficiently perform the operations insert, delete and search. No information other than n and the data is to be retained; and the only operations which we may perform on the data value... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A constant-factor approximation algorithm for the multicommodity rent-or-buy problem

    Publication Year: 2002, Page(s):333 - 342
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (373 KB) | HTML iconHTML

    We present the first constant factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of multicommodity buy-at-bulk network design in which there are two ways to install capacity on any given edge. Capacity can be rented, with cost incurred on a per-unit of capacity basis, or bought, which allows unlimited use ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Kolmogorov's structure functions with an application to the foundations of model selection

    Publication Year: 2002, Page(s):751 - 760
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (426 KB) | HTML iconHTML

    Kolmogorov (1974) proposed a non-probabilistic approach to statistics, an individual combinatorial relation between the data and its model. We vindicate, for the first time, the rightness of the original "structure function", proposed by Kolmogorov: minimizing the data-to-model code length (finding the ML estimator or MDL estimator), in a class of contemplated models of prescribed maximal (Kolmogo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Breaking the O(n1(2k-1)/) barrier for information-theoretic Private Information Retrieval

    Publication Year: 2002, Page(s):261 - 270
    Cited by:  Papers (25)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (431 KB) | HTML iconHTML

    Private information retrieval (PIR) protocols allow a user to retrieve a data item from a database while hiding the identity of the item being retrieved. Specifically, in information-theoretic, k-server PIR protocols the database is replicated among k servers, and each server learns nothing about the item the user retrieves. The cost of such protocols is measured by the communication complexity of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Satisfiability, branch-width and Tseitin tautologies

    Publication Year: 2002, Page(s):593 - 603
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2368 KB) | HTML iconHTML

    For a CNF τ, let wb(τ) be the branch-width of its underlying hypergraph. In this paper we design an algorithm for solving SAT in time nO(1)2O(w(b)(τ)). This in particular implies a polynomial algorithm for testing satisfiability on instances with tree-width O(log n). Our algorithm is a modification of the width based automated theorem prover (WBATP) whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dichotomy theorem for constraints on a three-element set

    Publication Year: 2002, Page(s):649 - 658
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on the possible form of constraints may affect the complexity, and lead to tractable problem classes. There is, therefore, a fundamental research direction, aiming to separate those subclasses of the CSP which are tractable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions

    Publication Year: 2002, Page(s):356 - 365
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (378 KB) | HTML iconHTML

    We study a generalization of the compact knapsack problem for arbitrary rings: given m = O(log n) ring elements a1, . . . , am ∈ R and a target value b ∈ R, find coefficients x1, . . . , xm ∈ X (where X is a subset of R of size 2n) such that Σaixi = b. The computational complexity of this problem depe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The asymptotic order of the random k-SAT threshold

    Publication Year: 2002, Page(s):779 - 788
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (394 KB) | HTML iconHTML

    Form a random k-SAT formula on n variables by selecting uniformly and independently m=rn clauses out of all 2k (kn) possible k-clauses. The satisfiability threshold conjecture asserts that for each k there exists a constant rk such that, as n tends to infinity, the probability that the formula is satisfiable tends to 1 if rk and to 0 if r>r... View full abstract»

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