1523 search results - page 155 / 305 » The Computational Complexity of Linear Optics |
ICTAC
2005
Springer
14 years 3 months ago
2005
Springer
We present a new derivation of eļ¬cient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the speciļ...
WIA
2001
Springer
14 years 2 months ago
2001
Springer
A vector algorithm is an algorithm that applies a bounded number of vector operations to an input vector, regardless of the length of the input. In this paper, we describe the link...
COCO
1993
Springer
14 years 2 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
LPAR
1994
Springer
14 years 2 months ago
1994
Springer
The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potent...
SODA
2000
ACM
13 years 11 months ago
2000
ACM
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...