1403 search results - page 147 / 281 » About Approximations of Exponentials |
131
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
146
Voted
SP
2010
IEEE
15 years 8 months ago
2010
IEEE
—Social networking sites such as Facebook, LinkedIn, and Xing have been reporting exponential growth rates. These sites have millions of registered users, and they are interestin...
130
click to vote
GLVLSI
2009
IEEE
15 years 8 months ago
2009
IEEE
Recent technology mappers for LUT based FPGAs employ cut enumeration. Although many cuts are often needed to nd good network, enumerating all cuts with large size consumes run-tim...
148
click to vote
EUROCRYPT
1995
Springer
15 years 8 months ago
1995
Springer
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
121
click to vote
OPODIS
2007
15 years 6 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...