๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Advances in Computational Complexity Theory

โœ Scribed by Jin-Yi Cai


Publisher
Amer Mathematical Society
Year
1993
Tongue
English
Leaves
110
Series
Dimacs Series in Discrete Mathematics and Theoretical Computer Science
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


This collection of recent papers on computational complexity theory grew out of activities during a special year at DIMACS. With contributions by some of the leading experts in the field, this book is of lasting value in this fast-moving field, providing expositions not found elsewhere. Although aimed primarily at researchers in complexity theory and graduate students in mathematics or computer science, the book is accessible to anyone with an undergraduate education in mathematics or computer science. By touching on some of the major topics in complexity theory, this book sheds light on this burgeoning area of research.

โœฆ Subjects


Software;Accounting;Adobe;Databases;Design & Graphics;E-mail;Enterprise Applications;Mathematical & Statistical;Microsoft;Optical Character Recognition;Personal Finance;Presentation Software;Project Management Software;Quickbooks;Spreadsheets;Suites;Utilities;Voice Recognition;Word Processing;Computers & Technology;Logic;Pure Mathematics;Mathematics;Science & Math;Mathematics;Algebra & Trigonometry;Calculus;Geometry;Statistics;Science & Mathematics;New, Used & Rental Textbooks;Specialty Boutique


๐Ÿ“œ SIMILAR VOLUMES


Computational Complexity Theory
โœ Juris Hartmanis (ed.) ๐Ÿ“‚ Library ๐Ÿ“… 1989 ๐Ÿ› Amer Mathematical Society ๐ŸŒ English

Computational complexity theory is the study of the quantitative laws that govern computing. During the last 25 years, this field has grown into a rich mathematical theory. Currently one of the most active research areas in computer science, complexity theory is of considerable interest to mathemati

Finite fields, coding theory, and advanc
โœ Gary L. Mullen, Peter Jau-Shyong Shiue ๐Ÿ“‚ Library ๐Ÿ“… 1993 ๐Ÿ› M. Dekker ๐ŸŒ English

The refereed proceedings of the First International Conference on Finite Fields, Coding Theory, and Advances in Communications and Computing. The volume aims to encourage interaction between the theoretical aspects of finite fields and applications in many areas including information theory.

Theory of Computational Complexity
โœ Ding-Zhu Du, Ker-I Ko ๐Ÿ“‚ Library ๐Ÿ“… 2000 ๐Ÿ› Wiley-Interscience ๐ŸŒ English

"Complexity theory studies the inherent difficulties of solving algorithmic problems by digital computers. This comprehensive work discusses the major topics in complexity theory, including fundamental topics as well as recent breakthroughs not previously available in book form."--BOOK JACKET. P