The Symposium on Theoretical Aspects of Computer Science is organized jointly by the Special Interest Group for Applied Mathematics of AFCET (Association Française de Cybernétique Economique et Technique) and the Special Interest Group for Theoretical Computer Sciences of GI (Gesellschaft für Informatik). It is held alternately in France and in Germany. This volume contains two invited papers, on combinatorial methods in computer science, and on the complexity of local optimization, and 24 contributions on theoretical aspects of computer science. Some software systems are presented showing the possibilities of applying theoretical research to the realization of software tools.
--This text refers to an alternate
Paperback
edition.
STACS 90
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for students on millions of items. Learn more |
| ||||||||||||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Browse and search another edition of this book.
Browse and search another edition of this book.
First Sentence:
The hierarchy theorems for time and space are among the oldest and most basic results in complexity theory. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
minimum vertex hulls, amortized update cost, probabilistic logspace machine, geodetic connectivity, interval semiwords, approximating pair, valuation sequence, local search problems, complexity classes collapse, irreducible normal forms, nondeterministic moves, bisecting curves, classic semantics, transition system semantics, nondeterministic time, coarsest equivalence, infinitely many strings, refined net, vertex separator, logic programming style, generalized spectra, hierarchy theorem, generalized spectrum, partial order semantics, congruence with respect Key Phrases - Capitalized Phrases (CAPs): (learn more)
Linear Programming, University of Wisconsin, National Science Foundation, Academic Press, Computational Geometry, Computer Graphics, Horn Clause Logic, System Sci, New York, Springer Verlag, Symbolic Logic, Theory of Computing, University of Bordeaux, Acta Informatica, Annual Symp, Computer Society Press, Internal Report, Systems Theory New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
The hierarchy theorems for time and space are among the oldest and most basic results in complexity theory. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
minimum vertex hulls, amortized update cost, probabilistic logspace machine, geodetic connectivity, interval semiwords, approximating pair, valuation sequence, local search problems, complexity classes collapse, irreducible normal forms, nondeterministic moves, bisecting curves, classic semantics, transition system semantics, nondeterministic time, coarsest equivalence, infinitely many strings, refined net, vertex separator, logic programming style, generalized spectra, hierarchy theorem, generalized spectrum, partial order semantics, congruence with respect Key Phrases - Capitalized Phrases (CAPs): (learn more)
Linear Programming, University of Wisconsin, National Science Foundation, Academic Press, Computational Geometry, Computer Graphics, Horn Clause Logic, System Sci, New York, Springer Verlag, Symbolic Logic, Theory of Computing, University of Bordeaux, Acta Informatica, Annual Symp, Computer Society Press, Internal Report, Systems Theory New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 46
books:
See all 46 books this book cites
- Computational Models of Games (ACM Distinguished Dissertation) by Anne Condon on page 215, and Back Matter
- Computer Science by Richard Jones in Front Matter, and page 81
- Logic Programming (Apic Studies in Data Processing) by K. Clark on page 108
- Computer Science: A Modern Introduction (Prentice-Hall International Series in Computer Science) by Les Goldschlager on page 57
- Computational Geometry: Algorithms and Applications, Second Edition by Mark de Berg on page 239
See all 46 books this book cites
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
