19320 search results - page 314 / 3864 » On the complexity of computing determinants |
160
click to vote
ISSAC
2001
Springer
15 years 11 months ago
2001
Springer
The degree of a rational map measures how often the map covers the image variety. In particular, when the rational map is a parametrization, the degree measures how often the para...
184
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
Many newly discovered genes are of unknown function. DNA microarrays are a method for determining the expression levels of all genes in an organism for which a complete genome seq...
156
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we introduce a fuzzy version of symport/antiport membrane systems. Our fuzzy membrane systems handle possibly inexact copies of reactives and their rules are endowed...
188
click to vote
SMA
2003
ACM
15 years 12 months ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
179
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...