3 search results - page 1 / 1 » On universally easy classes for NP-complete problems |
SODA
2001
ACM
13 years 6 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
CVPR
2009
IEEE
15 years 3 days ago
2009
IEEE
Graph-based methods form a main category of semisupervised
learning, offering flexibility and easy implementation
in many applications. However, the performance of
these methods...
CSFW
2010
IEEE
13 years 8 months ago
2010
IEEE
Nowadays it is widely accepted to formulate the security of a protocol carrying out a given task via the "trusted-party paradigm," where the protocol execution is compar...