Items related to Feasible Computations and Provable Complexity Properties:...
Feasible Computations and Provable Complexity Properties: 30 (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 30) - Softcover
Synopsis
null
"synopsis" may belong to another edition of this title.
Book Description
An overview of current developments in research on feasible computations. Defines and discusses efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE.
"About this title" may belong to another edition of this title.
Search results for Feasible Computations and Provable Complexity Properties:...
Stock Image
FEASIBLE COMPUTATIONS AND PROVABLE COMPLEXITY PROPERTIES.
Published by
Society of Industrial and Applied Mathematics:, 1978
ISBN 10: 0898710278
ISBN 13: 9780898710274
Used
Soft Cover
Seller: PASCALE'S BOOKS, NORTH READING, MA, U.S.A.
Seller rating 5 out of 5 stars
Soft Cover. Condition: Fine. 62 pages. "The purpose of this monograph is to give an overview and a discussion of some recent results about computational complexity of feasible computations and the study of provable properties about complexity of computations." FINE SOFTCOVER. Size: 4to - over 9¾" - 12" tall. Seller Inventory # 022766
Seller Image
Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 30)
Published by
Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
Used
paperback
First Edition
Seller: Coffee Cat Books, Chapel Hill, NC, U.S.A.
Seller rating 5 out of 5 stars
paperback. Condition: GOOD. First Edition. 1978. Vintage / Collectable Computer Science. PBK. Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 30). Society for Industrial and Applied Mathematics. Previous ownerâs name on title page. Text / formulas appear to be unmarked, no highlighting, underlining or writing. Softcover shows rubbing, corner creasing to back cover and some pages, edge and shelf wear from normal use. Binding is solid, square. Photos are of actual book you will receive. Ships quickly and with care. Seller Inventory # C0G091224G11
Stock Image
Feasible Computations and Provable Complexity Properties
Published by
Society for Industrial and Applied Mathematics (SIAM), 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
New
PAP
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FW-9780898710274
Buy New
£ 40.88
£ 3.29 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Stock Image
Feasible Computations and Provable Complexity Properties
Published by
Society for Industrial and Applied Mathematics,U.S., US, 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
New
Paperback
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations.The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions.The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes.The concluding discussion is on the possibility that the famous P=NP? problem is independent of the axioms of formal mathematical systems such as set theory. Seller Inventory # LU-9780898710274
Buy New
£ 46.67
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Feasible Computations and Provable Complexity Properties
Published by
Society for Industrial & Applied, 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
New
Paperback
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 70 pages. 10.00x7.00x0.25 inches. In Stock. Seller Inventory # __0898710278
Buy New
£ 39.47
£ 10 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Stock Image
Feasible Computations and Provable Complexity Properties
Published by
Society for Industrial & Applied Mathematics,U.S., 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
New
Paperback / softback
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Paperback / softback. Condition: New. New copy - Usually dispatched within 4 working days. Seller Inventory # B9780898710274
Buy New
£ 48.44
£ 12.33 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Stock Image
Feasible Computations and Provable Complexity Properties
Published by
Society for Industrial and Applied Mathematics (SIAM), 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
New
Softcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. 1987. paperback. . . . . . Books ship from the US and Ireland. Seller Inventory # V9780898710274
Stock Image
Feasible Computations and Provable Complexity Properties
Published by
Society for Industrial and Applied Mathematics (SIAM), 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
New
Softcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. 1987. paperback. . . . . . Seller Inventory # V9780898710274
Stock Image
Feasible Computations and Provable Complexity Properties
Published by
Society for Industrial and Applied Mathematics,U.S., US, 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
New
Paperback
Seller: Rarewaves.com UK, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations.The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions.The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes.The concluding discussion is on the possibility that the famous P=NP? problem is independent of the axioms of formal mathematical systems such as set theory. Seller Inventory # LU-9780898710274
Buy New
£ 40.87
£ 65 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 30)
Published by
Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
New
Softcover
Seller: SHIMEDIA, Brooklyn, NY, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Satisfaction Guaranteed or your money back. Seller Inventory # 0898710278