26 search results - page 1 / 6 » Real Computation with Least Discrete Advice: A Complexity Th... |
CCA
2009
Springer
13 years 12 months ago
2009
Springer
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
MST
2010
13 years 3 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
AMC
2007
13 years 5 months ago
2007
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
CPHYSICS
2007
13 years 5 months ago
2007
We describe adaptive continuation algorithms for computing energy levels of the Bose–Einstein condensates (BEC) with emphasis on the rotating BEC. We show that the rotating BEC ...