3208 search results - page 95 / 642 » A Lower Bound for Primality |
184
click to vote
NETWORKS
2006
15 years 6 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
150
click to vote
APPML
2005
15 years 6 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.
155
click to vote
TOC
2008
15 years 6 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)....