Eight Annual Conference on Structure in Complexity Theory 1993
Author : Steven Homer
Publisher :
Page : 161 pages
File Size : 26,42 MB
Release : 1996
Category :
ISBN :
Author : Steven Homer
Publisher :
Page : 161 pages
File Size : 26,42 MB
Release : 1996
Category :
ISBN :
Author : Steven Homer
Publisher :
Page : pages
File Size : 13,38 MB
Release : 1996
Category :
ISBN :
Author :
Publisher :
Page : pages
File Size : 25,82 MB
Release : 2002
Category :
ISBN :
Author :
Publisher :
Page : pages
File Size : 23,60 MB
Release : 1993
Category :
ISBN :
Author : Lane A. Hemaspaandra
Publisher : Springer Science & Business Media
Page : 360 pages
File Size : 27,6 MB
Release : 1997-06-05
Category : Computers
ISBN : 9780387949734
This volume provides a survey of the subject in the form of a collection of articles written by experts, that together provides a comprehensive guide to research. The editors'aim has been to provide an accessible description of the current stae of complexity theory, and to demonstrate the breadth of techniques and results that make this subject so exciting. Thus, papers run the gamut from sublogarithmic space to exponential time, and from new combinatorial techniques to interactive proof systems.
Author :
Publisher :
Page : 344 pages
File Size : 15,7 MB
Release : 1993
Category : Complexity Theory
ISBN :
Author : Structure in Complexity Theory Conference
Publisher :
Page : 60 pages
File Size : 46,30 MB
Release :
Category :
ISBN :
Author : IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing
Publisher :
Page : 412 pages
File Size : 26,41 MB
Release : 1994
Category : Computational complexity
ISBN :
Author : Structure in Complexity Theory Conference
Publisher :
Page : 218 pages
File Size : 22,89 MB
Release : 1992
Category :
ISBN :
Author : Rodney G. Downey
Publisher : Springer Science & Business Media
Page : 538 pages
File Size : 31,27 MB
Release : 2012-12-06
Category : Computers
ISBN : 1461205158
An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now. The book is as self-contained as possible and includes a great deal of background material. As a result, computer scientists, mathematicians, and graduate students interested in the design and analysis of algorithms will find much of interest.