Sciweavers

13603 search results - page 2 / 2721
» On the computational complexity of bridgecard
Sort
View
ENTCS
2011
131views more  ENTCS 2011»
13 years 9 days ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
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â...
Ed Blakey
ACMSE
2000
ACM
13 years 9 months ago
Exploring an information-based approach to computation and computational complexity
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...
D. E. Stevenson
VISUALIZATION
2002
IEEE
13 years 10 months ago
Christmas Tree Case Study: Computed Tomography as a Tool for Mastering Complex Real World Objects with Applications in Computer
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...
Armin Kanitsar, Thomas Theußl, Lukas Mroz, M...
CCA
2009
Springer
13 years 12 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
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 ...
Martin Ziegler
MEMBRANE
2009
Springer
13 years 12 months ago
A Computational Complexity Theory in Membrane Computing
Mario J. Pérez-Jiménez