275 search results - page 35 / 55 » Parameterized Complexity of Generalized Vertex Cover Problem... |
132
click to vote
ECCC
2007
15 years 4 months ago
2007
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with v...
132
click to vote
ACTA
2002
15 years 4 months ago
2002
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
167
click to vote
CRYPTO
2008
Springer
15 years 6 months ago
2008
Springer
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
288
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
134
click to vote
IJLIT
2010
15 years 2 months ago
2010
Whereas abandonment of detailed regulation is widely asserted to be the true way along with the fluctuations of the business models and emergence of IP-based services, there are s...