Sciweavers

3208 search results - page 134 / 642
» A Lower Bound for Primality
Sort
View
155
Voted
ECCC
2010
98views more  ECCC 2010»
15 years 7 months ago
A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem
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...
Amit Chakrabarti
DCC
2001
IEEE
16 years 6 months ago
Weierstrass Pairs and Minimum Distance of Goppa Codes
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...
Gretchen L. Matthews
175
Voted
FOCS
2008
IEEE
16 years 1 months ago
Arithmetic Circuits: A Chasm at Depth Four
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...
Manindra Agrawal, V. Vinay
142
Voted
CONTEXT
2007
Springer
16 years 1 months ago
Opinion Nets for Reasoning with Uncertain Context Information
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...
Yves Vanrompay, Yolande Berbers
FCT
2005
Springer
16 years 16 days ago
The Complexity of Querying External Memory and Streaming Data
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 (...
Martin Grohe, Christoph Koch, Nicole Schweikardt