28888 search results - page 54 / 5778 » Computability and complexity in analysis |
ENTCS
2011
13 years 2 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
ACMSE
2000
ACM
14 years 7 days ago
2000
ACM
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
VISUALIZATION
2002
IEEE
14 years 24 days ago
2002
IEEE
We report on using computed tomography (CT) as a model acquisition tool for complex objects in computer graphics. Unlike other modeling and scanning techniques the complexity of t...
CCA
2009
Springer
14 years 2 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 ...