Sciweavers

1523 search results - page 18 / 305
» The Computational Complexity of Linear Optics
Sort
View
AAECC
2007
Springer
133views Algorithms» more  AAECC 2007»
14 years 1 months ago
Linear Complexity and Autocorrelation of Prime Cube Sequences
Abstract. We review a binary sequence based on the generalized cyclotomy of order 2 with respect to p3 , where p is an odd prime. Linear complexities, minimal polynomials and autoc...
Young-Joon Kim, Seok-Yong Jin, Hong-Yeop Song
COMCOM
2011
13 years 2 months ago
Palmtree: An IP alias resolution algorithm with linear probing complexity
Internet topology mapping studies utilize large scale topology maps to analyze various characteristics of the Internet. IP alias resolution, the task of mapping IP addresses to th...
M. Engin Tozal, Kamil Saraç
COMPGEOM
2001
ACM
13 years 11 months ago
Hierarchical morse complexes for piecewise linear 2-manifolds
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...
Herbert Edelsbrunner, John Harer, Afra Zomorodian
COMPGEOM
2003
ACM
14 years 23 days ago
Morse-smale complexes for piecewise linear 3-manifolds
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its ...
Herbert Edelsbrunner, John Harer, Vijay Natarajan,...
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
13 years 11 months ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky