Sciweavers

481 search results - page 5 / 97
» Martin's game: a lower bound for the number of sets
Sort
View
JC
2011
87views more  JC 2011»
13 years 3 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
MST
2006
88views more  MST 2006»
13 years 8 months ago
Morpion Solitaire
We study a popular pencil-and-paper game called morpion solitaire. We present upper and lower bounds for the maximum score attainable for many versions of the game. We also show t...
Erik D. Demaine, Martin L. Demaine, Arthur Langerm...
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
14 years 16 days ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
ICALP
2005
Springer
14 years 2 months ago
Tight Lower Bounds for Query Processing on Streaming and External Memory Data
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is...
Martin Grohe, Christoph Koch, Nicole Schweikardt
SIAMCOMP
2002
95views more  SIAMCOMP 2002»
13 years 8 months ago
Lower Bounds for Lucas Chains
Lucas chains are a special type of addition chains satisfying an extra condition: for the representation ak = aj + ai of each element ak in the chain, the difference aj - ai must a...
Martin Kutz