When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network.
Completeness and Reduction in Algebraic Complexity Theory (Algorithms and
- Item No : 376328473261
- Condition : Brand New
- Brand : No brand Info
- Seller : loveourprices2
- Current Bid : US $109.55
-
* Item Description
- One of the most important and successful theories in computational complex ity is that of NP-completeness. Turing machines formalize al gorithms which operate on finite strings of symbols over a finite alphabet.
★ Recommended Products Related To This Item
♥ Best Selling Products in this category
