In computational applications, an algorithm may solve a given problem, but be "infeasible" in practice because it requires large time and space resources. A "feasible" algorithm requires a "small" amount of time and/or memory and can be implemented on an abstract computational device such as a Turing machine or a boolean circuit. In investigating feasible algorithms, a wide variety of tools from combinatorics, logic, computational complexity theory and algebra can be employed. The purpose of the workshop on which this ...
Read More
In computational applications, an algorithm may solve a given problem, but be "infeasible" in practice because it requires large time and space resources. A "feasible" algorithm requires a "small" amount of time and/or memory and can be implemented on an abstract computational device such as a Turing machine or a boolean circuit. In investigating feasible algorithms, a wide variety of tools from combinatorics, logic, computational complexity theory and algebra can be employed. The purpose of the workshop on which this volume is based was to carry on the work of the first "Feasible Mathematics" workshop, held in 1989. Both workshops were held at Cornell University and sponsored by the University and Mathematics Sciences Institute. This volume contains contributions to feasible mathematics in three areas: computational complexity theory, proof theory and algebra, with substantial overlap between different fields. Among the topics covered are: boolean circuit lower bounds, novel characteristics of various boolean and sequential complexity classes, fixed-parameter tractability, higher order feasible functionals, higher order programs related to Plotkin's PCF, combinatorial proofs of feasible length, bounded arithmetic, feasible interpretations, polynomial time categoricity, and algebraic properties of finitely generated recursively enumerable algebras.
Read Less
Add this copy of Feasible Mathematics II to cart. $51.65, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2011 by Birkhauser.
Add this copy of Feasible Mathematics II to cart. $58.08, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2011 by Birkhauser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Glued binding. 447 p. Progress in Computer Science and Applied Logic, 13. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Feasible Mathematics II (Progress in Computer Science to cart. $68.59, new condition, Sold by discount_scientific_books rated 5.0 out of 5 stars, ships from Sterling Heights, MI, UNITED STATES, published 1994 by Birkhauser.
Add this copy of Feasible Mathematics II (Progress in Computer Science to cart. $69.10, new condition, Sold by Basi6 International rated 5.0 out of 5 stars, ships from Irving, TX, UNITED STATES, published 1994 by Birkhauser.
Add this copy of Feasible Mathematics II (Progress in Computer Science to cart. $80.89, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 2011 by Birkhäuser.
Add this copy of Feasible Mathematics II to cart. $86.06, new condition, Sold by Media Smart rated 3.0 out of 5 stars, ships from Hawthorne, CA, UNITED STATES, published 1994 by Springer.
