Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Complexity AND YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal approximation of elliptic problems by linear and nonlinear mappings II
Stephan Dahlke
,
Erich Novak
,
Winfried Sickel
Journal of Complexity
22
(4), 2006, pp. 549-603
On the mean square weighted
L_2
discrepancy of randomized digital nets in prime base
Ligia L. Cristea
,
Josef Dick
,
Friedrich Pillichshammer
Journal of Complexity
22
(5), 2006, pp. 605-629
Randomly shifted lattice rules for unbounded integrands
Frances Y. Kuo
,
Grzegorz W. Wasilkowski
,
Benjamin J. Waterhouse
Journal of Complexity
22
(5), 2006, pp. 630-651
Exact cubature for a class of functions of maximum effective dimension
Shu Tezuka
,
Anargyros Papageorgiou
Journal of Complexity
22
(5), 2006, pp. 652-659
A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer
Arvid J. Bessen
Journal of Complexity
22
(5), 2006, pp. 660-675
Almost optimal solution of initial-value problems by randomized and quantum algorithms
Bolesƚaw Kacewicz
Journal of Complexity
22
(5), 2006, pp. 676-690
The quantum query complexity of elliptic PDE
Stefan Heinrich
Journal of Complexity
22
(5), 2006, pp. 691-725
Ideals in constructive Banach algebra theory
Douglas Bridges
,
Robin Havea
,
Peter Schuster
Journal of Complexity
22
(6), 2006, pp. 729-737
Randomness and universal machines
Santiago Figueira
,
Frank Stephan
,
Guohua Wu
Journal of Complexity
22
(6), 2006, pp. 738-751
A sequentially computable function that is not effectively continuous at any point
Peter Hertling
Journal of Complexity
22
(6), 2006, pp. 752-767
Representing probability measures using probabilistic processes
Matthias Schröder
,
Alex Simpson
Journal of Complexity
22
(6), 2006, pp. 768-782
Generalized functions with pseudobounded support in constructive mathematics
Satoru Yoshida
Journal of Complexity
22
(6), 2006, pp. 783-802
On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
Fuxiang Yu
,
Arthur Chou
,
Ker-I Ko
Journal of Complexity
22
(6), 2006, pp. 803-817
A hierarchy of Turing degrees of divergence bounded computable real numbers
Robert Rettinger
,
Xizhong Zheng
Journal of Complexity
22
(6), 2006, pp. 818-826
Effectively open real functions
Martin Ziegler
Journal of Complexity
22
(6), 2006, pp. 827-849
Random non-cupping revisited
George Barmpalias
Journal of Complexity
22
(6), 2006, pp. 850-857
Towards computability of elliptic boundary value problems in variational formulation
Vasco Brattka
,
Atsushi Yoshikawa
Journal of Complexity
22
(6), 2006, pp. 858-880
Pre-apartness structures on spaces of functions
D.S. Bridges
,
L.S. Vîţă
Journal of Complexity
22
(6), 2006, pp. 881-893
Effective continuities on effective topological spaces
Shinji Iizuka
Journal of Complexity
22
(6), 2006, pp. 894-908
The basic feasible functionals in computable analysis
Branimir Lambov
Journal of Complexity
22
(6), 2006, pp. 909-917
Computing Schrödinger propagators on type-2 Turing machines
Klaus Weihrauch
,
Ning Zhong
Journal of Complexity
22
(6), 2006, pp. 918-935
Seiten
<
1
2