Sciweavers

13603 search results - page 26 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
BSL
2008
97views more  BSL 2008»
13 years 8 months ago
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
Peter Cholak, Rodney G. Downey, Leo Harrington
CONCURRENCY
2010
85views more  CONCURRENCY 2010»
13 years 8 months ago
Complex version of high performance computing LINPACK benchmark (HPL)
R. F. Barrett, T. H. F. Chan, Eduardo F. D'Azevedo...
CORR
2008
Springer
80views Education» more  CORR 2008»
13 years 8 months ago
Complexity and algorithms for computing Voronoi cells of lattices
Mathieu Dutour Sikiric, Achill Schürmann, Fra...
CORR
2010
Springer
56views Education» more  CORR 2010»
13 years 8 months ago
The Computational Complexity of Linear Optics
Scott Aaronson, Alex Arkhipov