3208 search results - page 134 / 642 » A Lower Bound for Primality |
144
click to vote
ECCC
2010
15 years 6 months ago
2010
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
134
click to vote
DCC
2001
IEEE
16 years 6 months ago
2001
IEEE
We prove that elements of the Weierstrass gap set of a pair of points may be used to define a geometric Goppa code which has minimum distance greater than the usual lower bound. We...
160
click to vote
FOCS
2008
IEEE
16 years 27 days ago
2008
IEEE
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for expo...
132
click to vote
CONTEXT
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. Context-aware systems must be able to deal with uncertain context information. We propose a generic context architecture and representation that incorporates the uncertai...
177
click to vote
FCT
2005
Springer
15 years 12 months ago
2005
Springer
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...