Sudan, Madhu: Efficient checking of polynomials and proofs and the hardness of approximation problems

/ Madhu Sudan. - Berlin : Springer, 1995. - XIV, 87 S.; 24 cm - (Lecture notes in computer science; 1001)

ISBN 978-3-540-60615-4 / 3-540-60615-7 kart. : DM 38.00

Literaturverz. S. 73 - 78

Quelle: DNB

Drewes, Frank: Grammatical picture generation

: a tree based approach ; with CD-ROM / Frank Drewes. - Berlin : Springer, 2006. - XII, 474 S. : Ill., graph. Darst.; 24 cm - (Texts in theoretical computer science)

ISBN 978-3-540-21304-8 / 3-540-21304-X Pp. : EUR 74.85 (freier Pr.), sfr 106.00 (freier Pr.)

Literaturverz. S. 455 - 463

Quelle: DNB Verlagsmeldungen

Practice and theory of automated timetabling II

: second international conference ; selected papers / PATAT '97, Toronto, Canada, August 1997 / E. Burke ... (ed.). - Berlin : Springer, 2000. - Online-Ressource - (Lecture notes in computer science; 1408)

ISBN 978-3-540-49803-2

Lizenzpflichtig

Quelle: DNB

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

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