☰ Category

On the class of NP-complete problems and rank approach


Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days


Check Your Delivery Options

Product Out of Stock Subscription

(Notify me when this product is back in stock)

Rs. 3,718

Availability: Out of stock

  • Product Description

It is shown an incorrectness of introduction of a class of NP-complete problems, which reason is that Cook’s S.?. theorem on that the “satisfiability” problem is the universal NP-complete problem, is not true and, therefore, the issue on existence of at least one NP-complete problem remains open, that explains failures of attempts to estimate correlations between P and NP classes. Developed a universal procedure for solving a wide range of discrete optimization problems, which can be efficiently parallelized based on cyclic structures.

Product Specifications
SKU :COC60112
AuthorSergey Listrovoy
Number of Pages108
Publishing Year03.07.2014
Edition1 st
Book TypeMathematics
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-08-05 00:00:00
0 Review(s)