1920 search results - page 41 / 384 » The Complexity of the A B C Problem |
154
click to vote
DAC
2004
ACM
16 years 6 months ago
2004
ACM
This paper presents the Quantum-Dot Cellular Automata (QCA) physical design problem, in the context of the VLSI physical design problem. The problem is divided into three subprobl...
144
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
164
click to vote
TWC
2010
15 years 18 days ago
2010
It is known that Wideband Code-Division Multiple Access (W-CDMA) networks are limited by interference more than by any other single effect. Due to the frequency selectivity of the ...
154
click to vote
DAM
2008
15 years 6 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
169
click to vote
ANTS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ï...