Mathematical Foundations of Computer Science 1992 : 17th International Symposium, Prague, Czechoslovakia, August 24-28, 1992. Proceedings. 1st ed. 1992

種類:

電子ブック

責任表示:

edited by Ivan M. Havel, Vaclav Koubek

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1992

著者名:

• Havel, Ivan M.
• Koubek, Vaclav.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 629

ISBN:

9783540472919 [3540472916]    

注記:

On range searching with semialgebraic sets -- Graph layout problems -- Parallel recognition and ranking of context-free languages -- On the expansion of combinatorial polytopes -- Neural networks and complexity theory -- Theory of computation over stream algebras, and its applications -- Methods in parallel algorithmcs -- On the complexity of small description and related topics -- Weak parallel machines: A new class of physically feasible parallel machine models -- The complexity of graph connectivity -- A perfect parallel dictionary -- Some remarks on the test complexity of iterative logic arrays -- The degree structure of 1-L reductions -- Promise problems and access to unambiguous computation -- On the complexity of incremental computation -- Rational transductions and complexity of counting problems -- Negation elimination in equational formulae -- Object interaction -- Strong normalization of substitutions -- Probabilistic and pluralistic learners with mind changes -- Parallel complexity of iterated mor
This volume contains 10 invited papers and 40 short communications contributed for presentation at the 17th Symposium on Mathematical Foundations of Computer Science, held in Prague, Czechoslovakia, August 24-28, 1992. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Numerous topics are covered in this volume. The invited papers cover: range searching with semialgebraic sets, graph layout problems, parallel recognition and ranking of context-free languages, expansion of combinatorial polytopes, neural networks and complexity theory, theory of computation over stream algebras, methods in parallel algorithms, the complexity of small descriptions, weak parallel machines, and the complexity of graph connectivity.

ローカル注記:

学内専用E-BOOKS (local access only)