933 search results - page 19 / 187 » Monotone Complexity of a Pair |
IJISEC
2008
13 years 7 months ago
2008
The Ate pairing has been suggested since it can be computed efficiently on ordinary elliptic curves with small values of the traces of Frobenius t. However, not all pairing-friendl...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP do...
PR
2000
13 years 7 months ago
2000
Researchers have thus far focused on the recognition of alpha and numeric characters in isolation as well as in context. In this paper we introduce a new genre of problems where t...
JCC
2007
13 years 7 months ago
2007
: In this paper, I will look at the rather convoluted discovery process which gave birth to the concept of the shared electron pair bond as developed by G.N. Lewis, to be subsequen...
AAAI
2012
11 years 10 months ago
2012
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...