Sciweavers

FOCS
1998
IEEE
13 years 8 months ago
Recommendation Systems: A Probabilistic Analysis
A recommendation system tracks past actions of a group of users to make recommendations toindividualmembersofthe group. The growth ofcomputer-mediatedmarketingandcommerce has led ...
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopala...
FOCS
1998
IEEE
13 years 8 months ago
A Tight Characterization of NP with 3 Query PCPs
It is known that there exists a PCP characterization of NP where the verifier makes 3 queries and has a onesided error that is bounded away from 1; and also that 2 queries do not ...
Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, L...
FOCS
1998
IEEE
13 years 8 months ago
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...
FOCS
1998
IEEE
13 years 9 months ago
Unsatisfiable Systems of Equations, Over a Finite Field
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...
Alan R. Woods
FOCS
1998
IEEE
13 years 9 months ago
The Complexity of the Approximation of the Bandwidth Problem
d Abstract) Walter Unger Lehrstuhl f
Walter Unger
FOCS
1998
IEEE
13 years 9 months ago
Improved Bounds and Algorithms for Hypergraph Two-Coloring
Jaikumar Radhakrishnan, Aravind Srinivasan
FOCS
1998
IEEE
13 years 9 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov