hintergrundbild
logo
logo
Suchfeld einblenden
ISBN / EAN
Nachname
Vorname
Titel
Reihe
Schlagwort
und   oder
Index
Verlag
Ersch.-Jahr
bis
Katalog
Rezensent
Schlagwort Berechnungskomplexität
54 Treffer
Seite < 1 2 3 4 5 6 >
Cover

Machines, computations, and universality

: third international conference / MCU 2001, Chişinǎu, Moldova, May 23 - 27, 2001. M. Margenstern ... (ed.). - Berlin : Springer, 2001. - Online-Ressource - (Lecture notes in computer science; 2055)

ISBN 978-3-540-45132-7

Lizenzpflichtig

Quelle: DNB

Cover

Siegelmann, Hava T.: Neural networks and analog computation

: beyond the turing limit / Hava T. Siegelmann. - Boston : Birkhäuser, 1999. - XIV, 181 S. : graph. Darst.; 24 cm - (Progress in theoretical computer science)

ISBN 978-3-7643-3949-4 / 3-7643-3949-7 Pp. : sfr 88.00

Literaturverz. S. 165 - 178

Quelle: DNB

Cover

New computational paradigms

: proceedings / First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8 - 12, 2005. S. Barry Cooper ... (ed.). - Berlin : Springer, 2005. - XVII, 574 S. : graph. Darst., Kt.; 24 cm - (Lecture notes in computer science; Vol. 3526)

ISBN 978-3-540-26179-7 / 3-540-26179-6 kart. : EUR 72.76 (freier Pr.), sfr 120.50 (freier Pr.)

Literaturangaben

Quelle: DNB Verlagsmeldungen

Cover

Nonblocking supervisory control of state tree structures

/ Chuan Ma .... - Berlin : Springer, 2005. - Online-Ressource - (Lecture notes in control and information sciences; 317)

ISBN 978-3-540-31589-6

Lizenzpflichtig

Quelle: DNB

Cover

Parameterized and exact computation

: third international workshop ; proceedings / IWPEC 2008, Victoria, Canada, May 14 - 16, 2008. Martin Grohe ... (ed.). - Berlin : Springer, 2008. - Online-Ressource - (Lecture notes in computer science; 5018)

ISBN 978-3-540-79723-4

Lizenzpflichtig

Quelle: DNB

Cover

Parameterized and exact computation

: second international workshop ; proceedings / IWPEC 2006, Zürich, Switzerland, September 13 - 15, 2006. Hans L. Bodlaender ... (ed.). - Berlin : Springer, 2006. - Online-Ressource - (Lecture notes in computer science; 4169)

ISBN 978-3-540-39101-2

Lizenzpflichtig

Quelle: DNB

Cover

Randomness and completeness in computational complexity

/ D. van Melkebeek. - Berlin : Springer, 2001. - Online-Ressource - (Lecture notes in computer science; 1950)

ISBN 978-3-540-44545-6

Lizenzpflichtig

Quelle: DNB

Cover

Melkebeek, Dieter van: Randomness and completeness in computational complexity

/ Dieter VanMelkebeek. [Association for Computing Machinery]. - Berlin : Springer, 2000. - XV, 196 S. : graph. Darst.; 24 cm - (Lecture notes in computer science; Vol. 1950)

ISBN 978-3-540-41492-6 / 3-540-41492-4 kart. : DM 62.00

Literaturverz. S. 183 - 189

Quelle: DNB

Cover

Reliable implementation of real number algorithms

: theory and practice ; international seminar ; Dagstuhl Castle, Germany, January 8 - 13, 2006 ; revised papers / Peter Hertling ... (ed.). - Berlin : Springer, 2008. - Online-Ressource - (Lecture notes in computer science; 5045)

ISBN 978-3-540-85521-7

Lizenzpflichtig

Quelle: DNB

Cover

Substitutions in dynamics, arithmetics and combinatorics

/ N. Pytheas Fogg .... - Berlin : Springer, 2002. - Online-Ressource - (Lecture notes in mathematics; 1794)

ISBN 978-3-540-45714-5

Lizenzpflichtig

Quelle: DNB

Seite < 1 2 3 4 5 6 >
Projekte . Kooperationen
Advertorial