3415 search results - page 96 / 683 » Lower Bounds for Kernelizations |
125
click to vote
APPML
2005
15 years 4 months ago
2005
We prove that the maximal inscribed beamlet is at least 1/7 of an arbitrary line segment (i.e., beam). The implication of this result is addressed.
125
click to vote
TOC
2008
15 years 4 months ago
2008
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....