Polynomial Time Calculi

eBook (PDF), 285 Pages
This item has not been rated yet
Price: Free
This thesis is about type systems which guarantee polynomial time complexity of typed programs. A type system is a tool to give a computer program an additional structure which makes sure that it satisfies certain properties. In this work type systems are introduced and mathematically analysed, which type only those algorithms which terminate after polynomially many execution steps in the size of the input. Polynomial time is an important complexity class for practical application because polynomial algorithms grow reasonable fast to be feasibly computable also for bigger inputs.
Available in PDF Format

Ratings & Reviews

Log in to review this item
There are no reviews for the current version of this product
There are no reviews for previous versions of this product

Product Details

September 29, 2011
File Format
File Size
4.74 MB
Product ID

Formats for this Ebook

Required Software Any PDF Reader, Apple Preview
Supported Devices Windows PC/PocketPC, Mac OS, Linux OS, Apple iPhone/iPod Touch... (See More)
# of Devices Unlimited
Flowing Text / Pages Pages
Printable? Yes
Report This Content to Lulu >

Moderation of Questionable Content

Thank you for your interest in helping us moderate questionable content on Lulu. If you need assistance with an order or the publishing process, please contact our support team directly.

How does this content violate the Lulu Membership Agreement?


Listed In

More From Stefan Schimanski