Welcome To Our Store.
100,000+ Products for Home, Medical, Office & Classroom Needs
Search
0 $0.00 USD
1 1

Algebraic Systems and Computational Complexity Theory - Hardcover

$176.58 USD
$176.58 USD
Sale Sold out
Shipping calculated at checkout.
In stock (50 units), ready to be shipped

Available Offers

Fastest Delivery Tomorrow With Vip DealOrder within 1 hr 8 mins.

Instant 10% Discount On HDFC Banks Credit/Debit Cards EMI and CreditCard
Secure checkout with
  • American Express
  • Apple Pay
  • Diners Club
  • Discover
  • Google Pay
  • Mastercard
  • PayPal
  • Shop Pay
  • Visa
  • Daily deals
  • Return policy
  • Payment method
  • Help center 24/7

Flight Range: Up to 1,000 meters (3,280 feet)

Maximum Speed: 45 kilometers per hour (28 miles per hour)

For all orders exceeding a value of 100USD shipping is offered for free.

Returns will be accepted for up to 10 days of Customer’s receipt or tracking number on unworn items. You, as a Customer, are obliged to inform us via email before you return the item.

Otherwise, standard shipping charges apply. Check out our delivery Terms & Conditions for more details.

 View Product Details
Product Product subtotal Quantity Price Product subtotal
Algebraic Systems and Computational Complexity Theory - Hardcover
Algebraic Systems and Computational Complexity Theory - Hardcover
Algebraic Systems and Computational Complexity Theory - Hardcover
$176.58/ea		 $0.00
$176.58/ea $0.00

Product Description

by Tse-K'o Wang (Author), Z. Wang (Author), S. Xu (Author)

Preface; H.W. Kuhn. 1. Kuhn's Algorithm for Algebraic Equations. 2. Efficiency of Kuhn's Algorithm. 3. Newton Method and Approximate Zeros. 4. A Comparison of Kuhn's Algorithm and Newton Method. 5. Incremental Algorithms and their Cost Theory. 6. Homotopy Algorithms. 7. Probabilistic Discussion on Zeros of Polynomial Mappings. 9. Piecewise Linear Algorithms. References. Index.

Number of Pages: 260
Dimensions: 0.63 x 9.21 x 6.14 IN
Illustrated: Yes
Publication Date: November 30, 1994
you might like