Efficient checking of polynomials and proofs and the hardness of approximation problems
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
- 9783540606154
- 005.14 20 SUD-E
- QA267 .S83 1995
Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
![]() |
IIITD Reference | Computer Science and Engineering | REF 005.14 SUD-E (Browse shelf(Opens below)) | Available | 003781 |
Total holds: 0
Browsing IIITD shelves, Shelving location: Reference, Collection: Computer Science and Engineering Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
REF 005.14 DUN-S Software defect removal | REF 005.14 DUS-A Automated software testing : | REF 005.14 PEZ-S Software testing and analysis : | REF 005.14 SUD-E Efficient checking of polynomials and proofs and the hardness of approximation problems | REF 005.14 ZEL-W Why programs fail : | REF 005.16 TRI-S Software evolution and maintenance : | REF 005.2 PAC-I An introduction to parallel programming |
Based on the author's Ph. D. thesis, University of California, Berkeley, 1993.
Includes bibliographical references (p. [73]-78) and index.
There are no comments on this title.