19320 search results - page 198 / 3864 » On the complexity of computing determinants |
172
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
190
click to vote
EUROCRYPT
2004
Springer
15 years 12 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
168
click to vote
VTC
2008
IEEE
16 years 28 days ago
2008
IEEE
—Multiuser orthogonal frequency division multiplexing (MU-OFDM) is a promising technique for future wide-area mobile communications, which can provide scalable high data rate tra...
160
click to vote
SEMWEB
2005
Springer
16 years 19 hour ago
2005
Springer
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
141
click to vote
ERCIMDL
2003
Springer
15 years 11 months ago
2003
Springer
Addressing the preservation and long-term access issues for digital resources is one of the key challenges facing informational organisations such as libraries, archives, cultural ...