- STAFF PICKS
- GIFTS + GIFT CARDS
- SELL BOOKS
- FIND A STORE
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Other titles in the Texts in Computer Science series:
Computability and Complexity Theory (Texts in Computer Science)by Steven Homer
Synopses & Reviews
This volume introduces materials that are the core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations and subsequent chapters moving from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability round off the work, which focuses on the limitations of computability and the distinctions between feasible and intractable. Topics and features: *Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes *Contains information that otherwise exists only in research literature and presents it in a unified, simplified manner; for example, about complements of complexity classes, search problems, and intermediate problems in NP *Provides key mathematical background information, including sections on logic and number theory and algebra *Supported by numerous exercises and supplementary problems for reinforcement and self-study purposes With its accessibility and well-devised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential and practical learning tool.
This book surveys theoretical computer science, presenting fundamental concepts and results. Updated and revised, the new edition includes two new chapters on nonuniform complexity, circuit complexity and parallel complexity, and randomized complexity.
This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations.
Table of Contents
Mobile Collaborative Augmented Reality.- Current Status of Standards for Augmented Reality.- SmARt World - User-Friendly Mobile Ubiquitous Augmented Reality Framework.- Augmented Viewport: Towards Precise Manipulation at a Distance for Outdoor Augmented Reality Wearable Computers.- Design Recommendations for Augmented Reality based Training of Maintenance Skills.- Collaborative Content Generation Architectures for the Mobile Augmented Reality Environment.- A Platform for Mobile Collaborative Augmented Reality Game: A Case Study of "AR Fighter".- Effect of Collaboration and Competition in an Augmented Reality Mobile Game.- A Collaborative Augmented Reality Networked Platform for Edutainment.- Prototyping a Mobile AR Based Multi-user Guide System for Yuanmingyuan Garden.- HandsOnVideo: Towards a Gesture based Mobile AR System for Remote Collaboration.- Dynamic, Abstract Representations of Audio in a Mobile Augmented Reality Conferencing System.- Facilitating Collaboration with Laser Projector-Based Spatial Augmented Reality in Industrial Applications
What Our Readers Are Saying
Computers and Internet » Computers Reference » General