28888 search results - page 380 / 5778 » Computability and complexity in analysis |
178
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
180
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
160
click to vote
JEI
2007
15 years 6 months ago
2007
Multiscale error diffusion (MED) is superior to conventional error diffusion algorithms as it can eliminate directional hysteresis completely. However, due to its frame-oriented p...
143
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
We introduce two hierarchies of unknown ordinal height. The hierarchies are induced by natural fragments of a calculus based on finite types and G