7 search results - page 1 / 2 » Relative to a Random Oracle, NP is Not Small |
COCO
1994
Springer
13 years 9 months ago
1994
Springer
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Abstract. Identity-based encryption (IBE) schemes are usually used in multiplePKG environments — on the one hand, each administrative domain (e.g., a relatively small and close o...
SISAP
2009
IEEE
13 years 11 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
IOR
2006
13 years 4 months ago
2006
The paper considers robust optimization to cope with uncertainty about the stock return process in one period option hedging problems. The robust approach relates portfolio choice ...