Sciweavers

FOCS
2003
IEEE
14 years 29 days ago
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
Martin Grohe
FOCS
2003
IEEE
14 years 29 days ago
On the (In)security of the Fiat-Shamir Paradigm
Shafi Goldwasser, Yael Tauman Kalai
FOCS
2003
IEEE
14 years 29 days ago
On the Implementation of Huge Random Objects
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
Oded Goldreich, Shafi Goldwasser, Asaf Nussboim
FOCS
2003
IEEE
14 years 29 days ago
Clustering with Qualitative Information
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
Moses Charikar, Venkatesan Guruswami, Anthony Wirt...
FOCS
2003
IEEE
14 years 29 days ago
On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
Timothy M. Chan
FOCS
2003
IEEE
14 years 29 days ago
Paths, Trees, and Minimum Latency Tours
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, ...
FOCS
2003
IEEE
14 years 29 days ago
Learning DNF from Random Walks
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell,...
FOCS
2003
IEEE
14 years 29 days ago
On Worst-Case to Average-Case Reductions for NP Problems
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
Andrej Bogdanov, Luca Trevisan
FOCS
2003
IEEE
14 years 29 days ago
Approximation Algorithms for Orienteering and Discounted-Reward TSP
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
Avrim Blum, Shuchi Chawla, David R. Karger, Terran...
FOCS
2003
IEEE
14 years 29 days ago
Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model
We study the stability of the commonly used packet forwarding protocol, FIFO (First In First Out), in the adversarial queueing model. We prove that FIFO can become unstable, i.e.,...
Rajat Bhattacharjee, Ashish Goel