This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set. The book starts with a broad introduction to the field and progresses to advanced results. Contents include: definition of Turing machines and basic time and space complexity classes, probabilistic algorithms, interactive proofs, cryptography, quantum computation, lower bounds for concrete computational models (decision trees, communication complexity, constant depth, algebraic and monotone circuits, proof complexity), average-case complexity and hardness amplification, derandomization and pseudorandom constructions, and the PCP theorem.

Cryptography, secret writing, is probably as old as writing itself. But only recently has it become the object of extensive scientific studies. Vast new applications to data security are one explanation for this. Perhaps a more important reason for the huge growth of scientific research on cryptography is the seminal idea of public-key cryptography and the resulting new vistas on the possibilities of communication. This book gives a broad overview of public-key cryptography, covering its essence and advantages, various public-key cryptosystems and protocols. It also gives a comprehensive introduction to classical cryptography and cryptanalysis. The book is self-contained and suitable both as a text and as a reference. It starts from the beginning but also includes some 1989 developments. The presentation is in many ways new, with some new results. The treatment is rigorous but avoids unnecessary formalism. The plaintext examples in the book form a package of basic sauna knowledge.

This book presents the joint post-proceedings of five international workshops organized by the Japanese Society for Artificial Intelligence, during the 19th Annual Conference JSAI 2005. The volume includes 5 award winning papers of the main conference, along with 40 revised full workshop papers, covering such topics as logic and engineering of natural language semantics, learning with logics, agent network dynamics and intelligence, conversational informatics and risk management systems with intelligent data analysis.

For beginning graduate-level courses in computational geometry. This up-to-date and concise introduction to computational geometry with emphasis on simple randomized methods is designed for quick, easy access to beginners.