On a Logical Model of Combinatorial Problems

doi:10.4236/oalib.1101479

OALib Journal期刊
ISSN: 2333-9721
费用：99美元

查看量	下载量

Open Access Library Journal 2 2015

查看所有领域

On a Logical Model of Combinatorial Problems

DOI: 10.4236/oalib.1101479, PP. 1-6

Anatoly D. Plotnikov

Subject Areas: Combinatorial Mathematics

Keywords: Logical Model, Combinatorial Problem, Class P, Class NP

Full-Text Cite this paper Add to My Lib

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.

Cite this paper

Plotnikov, A. D. (2015). On a Logical Model of Combinatorial Problems. Open Access Library Journal, 2, e1479. doi: http://dx.doi.org/10.4236/oalib.1101479.

References

[1]	Garey, M.R. and Johnsonm D.S. (1979) Computers and Intractability. W. H. Freeman and Company, San Francisco.
[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.

Full-Text

comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133

WeChat 1538708413