Matches in Harvard for { <http://id.lib.harvard.edu/aleph/002365980/catalog> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- catalog abstract ""This volume contains papers which were contributed for presentation at the international conference "Fundamentals of Computation Theory - FCT '91" heldat Gosen, near Berlin, September 9-13, 1991. This was the eighth in the series of FCT conferences organized every odd year. The programme of theconference, including invited lectures and selected contributions, falls into the following categories: - Semantics and logical concepts in the theory of computing, formal specification, - Automata and formal languages, Computational geometry, - Algorithmic aspects of algebra and algebraic geometry, cryptography, - Complexity (sequential, parallel, distributed computing, structure, lower bounds, complexity of analytical problems, general concepts), - Algorithms (efficient, probabilistic, parallel, sequential, distributed), - Counting and combinatorics in connection with mathematical computer science. The proceedings of previous FCT meetings are available as Lecture Notes in Computer Science (Vols. 380, 278, 199, 158, 117, 56)."--PUBLISHER'S WEBSITE.".
- catalog contributor b3403546.
- catalog contributor b3403547.
- catalog created "c1991.".
- catalog date "1991".
- catalog date "c1991.".
- catalog dateCopyrighted "c1991.".
- catalog description ""This volume contains papers which were contributed for presentation at the international conference "Fundamentals of Computation Theory - FCT '91" heldat Gosen, near Berlin, September 9-13, 1991. This was the eighth in the series of FCT conferences organized every odd year. The programme of theconference, including invited lectures and selected contributions, falls into the following categories: - Semantics and logical concepts in the theory of computing, formal specification, - Automata and formal languages, Computational geometry, - Algorithmic aspects of algebra and algebraic geometry, cryptography, - Complexity (sequential, parallel, distributed computing, structure, lower bounds, complexity of analytical problems, general concepts), - Algorithms (efficient, probabilistic, parallel, sequential, distributed), - Counting and combinatorics in connection with mathematical computer science. The proceedings of previous FCT meetings are available as Lecture Notes in Computer Science (Vols. 380, 278, 199, 158, 117, 56)."--PUBLISHER'S WEBSITE.".
- catalog description "Includes bibliographical references.".
- catalog extent "xii, 426 p. :".
- catalog hasFormat "Fundamentals of computation theory.".
- catalog identifier "0387544585 (New York)".
- catalog identifier "3540544585 (Berlin)".
- catalog isFormatOf "Fundamentals of computation theory.".
- catalog isPartOf "Lecture notes in computer science ; 529".
- catalog issued "1991".
- catalog issued "c1991.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer-Verlag,".
- catalog relation "Fundamentals of computation theory.".
- catalog subject "004 20".
- catalog subject "Computational complexity Congresses.".
- catalog subject "Electronic data processing Congresses.".
- catalog subject "QA75.5 .I573 1991".
- catalog title "Fundamentals of computation theory : 8th International Conference, FCT '91, Gosen, Germany, September 9-13, 1991 : proceedings / L. Budach, ed.".
- catalog type "Conference proceedings. fast".
- catalog type "text".