Many researchers from different countries converged at the 10th Italian Conference on Theoretical Computer Science (ICTCS 2007) to discuss recent developments in theoretical computer science. The volume contains all contributed papers selected for presentation with the invited lectures delivered. The subjects of this book range from logical and mathematical aspects of computing, design and analysis of algorithms, to semantics of programming languages.
FREE Two-Day Shipping for Students. 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)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
steiner tree problem, steiner forest problem, colored graphs, time approximation schemes, parameterized complexity, random derangements, polymorphic method types, compositional compilation, atomic descendants, unescapable paths, finite discrete dynamical systems, group steiner tree problem, branching rule corresponding, unobservable classes, witness extraction, fixed point counting, following process terms, composable term, directed feedback vertex, counting fixed points, recombination node, binary fragments, entering neighbors, malicious prover, acyclic subset Key Phrases - Capitalized Phrases (CAPs): (learn more)
L-Fuzzy Sets, Object-Oriented Programming, Bare Public-key Model, Weak Markovian Bisimilarity, Analyzing Non-Interference, Theoretical Computer Science, Modeling Fuzzy Behaviours, Featherweight Java, Lecture Notes, New York, Weak Pattern Matching, Technical Report, Computing Minimum Directed Feedback Vertex Set, Italy E-mail, Sorting Streamed Multisets, Principles of Programming Languages, Fuzzy Hennessy-Milner Logic, Abstract Non-Interference, Machine Hypothesis, Fuzzy Labelled Transition Systems, Discrete Algorithms, Weak Presburger Arithmetic, Boolean Dynamical Systems Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
steiner tree problem, steiner forest problem, colored graphs, time approximation schemes, parameterized complexity, random derangements, polymorphic method types, compositional compilation, atomic descendants, unescapable paths, finite discrete dynamical systems, group steiner tree problem, branching rule corresponding, unobservable classes, witness extraction, fixed point counting, following process terms, composable term, directed feedback vertex, counting fixed points, recombination node, binary fragments, entering neighbors, malicious prover, acyclic subset Key Phrases - Capitalized Phrases (CAPs): (learn more)
L-Fuzzy Sets, Object-Oriented Programming, Bare Public-key Model, Weak Markovian Bisimilarity, Analyzing Non-Interference, Theoretical Computer Science, Modeling Fuzzy Behaviours, Featherweight Java, Lecture Notes, New York, Weak Pattern Matching, Technical Report, Computing Minimum Directed Feedback Vertex Set, Italy E-mail, Sorting Streamed Multisets, Principles of Programming Languages, Fuzzy Hennessy-Milner Logic, Abstract Non-Interference, Machine Hypothesis, Fuzzy Labelled Transition Systems, Discrete Algorithms, Weak Presburger Arithmetic, Boolean Dynamical Systems Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
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. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
