Sciweavers

329 search results - page 5 / 66
» New lower bounds for some spherical designs
Sort
View
ANTS
2006
Springer
79views Algorithms» more  ANTS 2006»
13 years 11 months ago
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q
Let E be an elliptic curve over the rationals. A crucial step in determining a Mordell-Weil basis for E is to exhibit some positive lower bound > 0 for the canonical height ^h ...
John Cremona, Samir Siksek
IMA
1999
Springer
69views Cryptology» more  IMA 1999»
13 years 11 months ago
Some Applications of Bounds for Designs to the Cryptography
Recent years have seen numerous examples when designs play an important role in the study of such topics in cryptography as secrecy and authentication codes, secret sharing scheme...
Svetla Nikova, Ventzislav Nikov
ECCC
2011
185views ECommerce» more  ECCC 2011»
13 years 2 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
AAAI
2006
13 years 8 months ago
Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT
Many lower bound computation methods for branch and bound Max-SAT solvers can be explained as procedures that search for disjoint inconsistent subformulas in the Max-SAT instance ...
Chu Min Li, Felip Manyà, Jordi Planes
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
14 years 4 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams