On a Logical Model of Combinatorial Problems

DOI: 10.4236/oalib.1101479   PDF   HTML   XML   604 Downloads   824 Views  

Abstract

The paper proposes a logical model of combinatorial problems; it also gives an example of a problem of the class NP that cannot be solved in polynomial time on the dimension of the problem.

Share and Cite:

Plotnikov, A. (2015) On a Logical Model of Combinatorial Problems. Open Access Library Journal, 2, 1-6. doi: 10.4236/oalib.1101479.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1] Garey, M.R. and Johnsonm D.S. (1979) Computers and Intractability. W. H. Freeman and Company, San Francis-co.
[2] Papadimitriou, C.H. and Steiglitz, K. (1982) Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall Inc., Upper Saddle River, NY.
[3] Crescenzi, P. and Kann,V. (1997) Approximation on the Web: A Compendium of NP Optimization Problems. Proceedings of International Workshop RANDOM’97, Bologna, 11-12 July 1997, 111-118.
[4] Plotnikov, A.D. (2013) On the Structure of the Class NP. Computer Communication & Collaboration, 1, 19-25.

  
comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.