Sciweavers

4047 search results - page 159 / 810
» The Discrete Basis Problem
Sort
View
113
Voted
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 4 months ago
Quantum complexity theory
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...
Ethan Bernstein, Umesh V. Vazirani
98
Voted
ISSA
2004
15 years 2 months ago
Are Current B2b Security Standards Antithetical To Global Interoperability?
This paper argues that powerful impetus exists for the realisation of a global multilateral electronic market infrastructure, as envisaged by the ebXML1 endeavour. Crucial in this...
Maree Pather
CPHYSICS
2006
103views more  CPHYSICS 2006»
15 years 25 days ago
WATERWAVES: wave particles dynamics on a complex triatomic potential
The WATERWAVES program suite performs complex scattering calculations by propagating a wave packet in a complex, full-dimensional potential for non-rotating (J = 0) but vibrating ...
Simone Taioli, Jonathan Tennyson
CN
2000
128views more  CN 2000»
15 years 19 days ago
The Network Workbench: network simulation software for academic investigation of Internet concepts
Simulation offers significant advantages as a basis for academic projects in computer networking. many unimportant details can be abstracted away, and also because simulations can...
J. Mark Pullen
105
Voted
IJAC
2007
116views more  IJAC 2007»
15 years 22 days ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil