Gopal / Cooper / Agrawal | Theory and Applications of Models of Computation | Buch | 978-3-319-06088-0 | sack.de

Buch, Englisch, 423 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 6613 g

Reihe: Theoretical Computer Science and General Issues

Gopal / Cooper / Agrawal

Theory and Applications of Models of Computation

11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings
2014
ISBN: 978-3-319-06088-0
Verlag: Springer International Publishing

11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014, Proceedings

Buch, Englisch, 423 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 6613 g

Reihe: Theoretical Computer Science and General Issues

ISBN: 978-3-319-06088-0
Verlag: Springer International Publishing


This book constitutes the refereed proceedings of the 11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014, held in Chennai, India, in April 2014. The 27 revised full papers presented were carefully reviewed and selected from 112 submissions. The papers explore the algorithmic foundations, computational methods and computing devices to meet today's and tomorrow's challenges of complexity, scalability and sustainability, with wide-ranging impacts on everything from the design of biological systems to the understanding of economic markets and social networks.

Gopal / Cooper / Agrawal Theory and Applications of Models of Computation jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


A Roadmap for TAMC.- A tight lower bound instance for k-means++ in constant dimension.- An improved Upper-bound for Rivest et al.’s Half-lie Problem.- Reversibility of Elementary Cellular Automata Under Fully Asynchronous Update.- Finite State Incompressible Infinite Sequences.- Finding optimal strategies of almost acyclic Simple Stochastic Games.- The Parameterized Complexity of Domination-type Problems and Application to Linear Codes.- On representations of abstract systems with partial inputs and outputs.- Complexity Information Flow in a Multi-threaded Imperative Language.- An Incremental Algorithm for Computing Prime Implicates in Modal Logic.- Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-like Set Systems.- space complexity of optimization problems in planar graphs.- Fine Tuning Decomposition Theorem for Maximum Weight Bipartite Matching.- Intersection Dimension of Bipartite Graphs.- On the Parameterized Complexity for Token Jumping on Graphs.- More on Universality of Spiking Neural P Systems with Anti-Spikes.- Modular Form Approach to Solving Lattice Problems.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.