Amazon cover image

Image from Amazon.com

Normal view MARC view ISBD view

Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems edited by Madhu Sudan.

By:

Sudan, Madhu

Material type: Text

Text

TextDescription: On-campus e-Book by Springer under Digital Library Program of Higher Education Commission (HEC) of PakistanISBN:

9783540484851

Subject(s):

Computer science.; Software engineering.; Coding theory.; Computer software.; Logic design.; Numerical analysis.; Computer Science.; Algorithm Analysis and Problem Complexity.; Logics and Meanings of Programs.; Software Engineering.; Mathematical Logic and Formal Languages.; Coding and Information Theory.; Numerical Analysis

Online resources:

Click her to access the e-Book

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
e-Book	ICCBS Digital Library		Not for loan

© International Center for Chemical and Biological Sciences (ICCBS) Libraries, 2011. All rights reserved.