1225 search results - page 5 / 245 » The Instance Complexity Conjecture |
IJAC
2007
14 years 9 months ago
2007
Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...
JCT
2010
14 years 8 months ago
2010
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
93
Voted
EUROCRYPT
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
94
Voted
ECCC
2010
14 years 9 months ago
2010
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...
102
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...