4757 search results - page 5 / 952 » A Unique |
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
MFCS
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
DAGSTUHL
1993
13 years 8 months ago
1993
In this paper we present a type system for graph rewrite systems: uniqueness typing. It employs usage information to deduce whether an object is `unique' at a certain moment,...
APPML
2008
13 years 7 months ago
2008
The present work is concerned with the uniqueness problem of best simultaneous approximation. An n-dimensional l1- or l-simultaneous unicity space is characterized in terms of Pro...