Order Total (1 Item Items):
Shipping Destination:
Feasible Mathematics (41 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (41)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (27)
- As New, Fine or Near Fine (3)
- Very Good or Good (4)
- Fair or Poor (No further results match this refinement)
- As Described (7)
Binding
Collectible Attributes
- First Edition (2)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (10)
- Not Print on Demand (31)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
Feasible Mathematics: A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989
Seller: Charles Berry, Bookseller, Lakeport, CA, U.S.A.
Seller rating 5 out of 5 stars
First Edition
Hardcover. Condition: Good. 1st Edition. Library-discharged hardcover with typical library markings (lower spine, page edges, inside front and back covers, upper corners of the first few endpapers, copyright and preface pages). Absent these markings, this book would be excellent with slight handling. 350 pages, text entirely unmarked. [1.4 lbs]. Book.
-
Feasible Mathematics: A Mathematical Sciences Institute Workshop, Ithaca NY, June 1989.; (Progress in Computer Science and Applied Logic, 9.)
Seller: J. HOOD, BOOKSELLERS, ABAA/ILAB, Baldwin City, KS, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. 350pp. Some neat highlighting on 3 pages, otherwise VG+ condition.
-
Hard Cover. Condition: Fine. 350 pages. "This book includes both the sudy of feasible compuation from a mathematical and logical point of view and the reworking of traditional mathematics from the point of view of feasible computation." FINE HARDCOVER. Size: 8vo - over 7¾" - 9¾" tall.
-
Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 30)
Language: English
Published by Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898710278 ISBN 13: 9780898710274
First Edition
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.
-
Condition: Used. pp. 364.
-
Condition: Used. pp. 364 23:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on White w/Gloss Lam.
-
Condition: Used. pp. 364.
-
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Condition: Used. pp. 447 1st Edition, Reprint.
-
Feasible Mathematics II (Progress in Computer Science and Applied Logic)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 50.80
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Feasible Mathematics: A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989 (Progress in Computer Science and Applied Logic, 9)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 50.80
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
-
Condition: Used. pp. 447.
-
Condition: Used. pp. 447.
-
Feasible Mathematics: A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. 1990. Paperback. . . . . .
-
Feasible Mathematics II
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. 2011. Paperback. . . . . .
-
Condition: New. pp. 460.
-
Hardcover. Condition: Brand New. 350 pages. 9.50x6.50x1.00 inches. In Stock.
-
Condition: New. 1990. Paperback. . . . . . Books ship from the US and Ireland.
-
Condition: New. 2011. Paperback. . . . . . Books ship from the US and Ireland.
-
Hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
-
-
Optimality in nonlinear programming: A feasible directions approach (Pure and applied mathematics)
Language: English
Published by John Wiley & Sons Inc, 1981
ISBN 10: 0471080578 ISBN 13: 9780471080572
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Seller rating 5 out of 5 stars
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
-
Feasible Mathematics : A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989
Language: English
Published by Birkhäuser, Birkhäuser, 1990
ISBN 10: 0817634835 ISBN 13: 9780817634834
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - A so-called 'effective' algorithm may require arbitrarily large finite amounts of time and space resources, and hence may not be practical in the real world. A 'feasible' algorithm is one which only requires a limited amount of space and/or time for execution; the general idea is that a feasible algorithm is one which may be practical on today's or at least tomorrow's computers. There is no definitive analogue of Church's thesis giving a mathematical definition of feasibility; however, the most widely studied mathematical model of feasible computability is polynomial-time computability. Feasible Mathematics includes both the study of feasible computation from a mathematical and logical point of view and the reworking of traditional mathematics from the point of view of feasible computation. The diversity of Feasible Mathematics is illustrated by the. contents of this volume which includes papers on weak fragments of arithmetic, on higher type functionals, on bounded linear logic, on sub recursive definitions of complexity classes, on finite model theory, on models of feasible computation for real numbers, on vector spaces and on recursion theory. The vVorkshop on Feasible Mathematics was sponsored by the Mathematical Sciences Institute and was held at Cornell University, June 26-28, 1989.
-
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Perspicuity is part of proof. If the process by means of which I get a result were not surveyable, I might indeed make a note that this number is what comes out - but what fact is this supposed to confirm for me I don't know 'what is supposed to come out' . . . . 1 -L. Wittgenstein A feasible computation uses small resources on an abstract computa tion device, such as a 'lUring machine or boolean circuit. Feasible math ematics concerns the study of feasible computations, using combinatorics and logic, as well as the study of feasibly presented mathematical structures such as groups, algebras, and so on. This volume contains contributions to feasible mathematics in three areas: computational complexity theory, proof theory and algebra, with substantial overlap between different fields. In computational complexity theory, the polynomial time hierarchy is characterized without the introduction of runtime bounds by the closure of certain initial functions under safe composition, predicative recursion on notation, and unbounded minimization (S. Bellantoni); an alternative way of looking at NP problems is introduced which focuses on which pa rameters of the problem are the cause of its computational complexity and completeness, density and separation/collapse results are given for a struc ture theory for parametrized problems (R. Downey and M. Fellows); new characterizations of PTIME and LINEAR SPACE are given using predicative recurrence over all finite tiers of certain stratified free algebras (D.
-
Paperback. Condition: Like New. Like New. book.
-
Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 30)
Language: English
Published by Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898710278 ISBN 13: 9780898710274
Condition: New. Satisfaction Guaranteed or your money back.
-
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
