1225 search results - page 134 / 245 » The Instance Complexity Conjecture |
SODA
2001
ACM
13 years 10 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...
AAAI
1998
13 years 10 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
IADT
1998
13 years 10 months ago
1998
One of the main tasks of workflow management systems is the coordination of activities in business processes. This paper introduces a solution framework to support adaptive workfl...
UAI
2000
13 years 10 months ago
2000
Sampling is an important tool for estimating large, complex sums and integrals over highdimensional spaces. For instance, importance sampling has been used as an alternative to ex...
ACNS
2010
Springer
13 years 10 months ago
2010
Springer
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...