292 search results - page 26 / 59 » Are Stable Instances Easy |
71
Voted
HAPTICS
2008
IEEE
15 years 7 months ago
2008
IEEE
If you have multiple objects in your pocket, some are easy to find among the other ones, for instance, when they differ much in material properties or shape. Information on which...
101
Voted
HIP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We would like to quantify the assurance contained in an authentication secret. For instance, how much assurance does a customer convey to a bank by revealing that his Per...
87
Voted
APN
2004
Springer
15 years 6 months ago
2004
Springer
Renew is a computer tool that supports the development and execution of object-oriented Petri nets, which include net instances, synchronous channels, and seamless Java integration...
110
click to vote
ISSAC
2004
Springer
15 years 6 months ago
2004
Springer
There exist sound literature and algorithms for computing Liouvillian solutions for the important problem of linear ODEs with rational coefficients. Taking as sample the 363 secon...
75
Voted
STACS
1999
Springer
15 years 5 months ago
1999
Springer
We demonstrate how to use Lautemann's proof that BPP is in p 2 to exhibit that BPP is in RPPromiseRP. Immediate consequences show that if PromiseRP is easy or if there exist q...