Sciweavers

16666 search results - page 74 / 3334
» Descriptive and Computational Complexity
Sort
View
133
Voted
CORR
2010
Springer
114views Education» more  CORR 2010»
15 years 2 months ago
Computational Complexity of Iterated Maps on the Interval
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is ch...
Christoph Spandl
153
Voted
CORR
2000
Springer
95views Education» more  CORR 2000»
15 years 3 months ago
One Complexity Theorist's View of Quantum Computing
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or t...
Lance Fortnow
120
Voted
TCOM
2011
108views more  TCOM 2011»
14 years 10 months ago
Computational Complexity of Decoding Orthogonal Space-Time Block Codes
— The computational complexity of optimum decoding for an orthogonal space-time block code is quantified. Four equivalent techniques of optimum decoding which have the same comp...
Ender Ayanoglu, Erik G. Larsson, Eleftherios Karip...
153
Voted
VIS
2008
IEEE
134views Visualization» more  VIS 2008»
16 years 5 months ago
A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality
The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for lar...
Attila Gyulassy, Peer-Timo Bremer, Bernd Hamann,...
143
Voted
RTA
2010
Springer
15 years 7 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser