288 search results - page 12 / 58 » Recent progress in quantum algorithms |
ANTS
2004
Springer
14 years 2 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
ISMDA
2005
Springer
14 years 2 months ago
2005
Springer
Over recent years the field of phylogenetics has witnessed significant algorithmic and technical progress. A new class of efficient phylogeny programs allows for computation of l...
QOSA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Component interfaces, as advanced by the Common Component Architecture (CCA), enable easy access to complex software packages for high-performance scientific computing. ...
FASE
2011
Springer
13 years 8 days ago
2011
Springer
Given a program and an assertion in that program, determining if the assertion can fail is one of the key applications of program analysis. Symbolic execution is a well-known techn...
CALCO
2005
Springer
14 years 2 months ago
2005
Springer
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...