Complete problems for monotone NP

被引：0

作者：

机构：

来源：

Theor Comput Sci | / 1-2卷 / 147期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[1] COMPLETE PROBLEMS FOR MONOTONE NP
STEWART, IA
THEORETICAL COMPUTER SCIENCE, 1995, 145 (1-2) : 147 - 157
[2] The monotone Lambek calculus is NP-complete
Pentus, Mati
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8222 : 368 - 380
[3] NP-COMPLETE SCHEDULING PROBLEMS
ULLMAN, JD
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1975, 10 (03) : 384 - 393
[4] The entropy of NP-complete problems
Levchenkov, VS
DOKLADY MATHEMATICS, 2001, 63 (01) : 130 - 132
[5] Decidability of NP-Complete Problems
Vagis, A. A.
Gupal, A. M.
CYBERNETICS AND SYSTEMS ANALYSIS, 2022, 58 (06) : 914 - 916
[6] Entropy for NP-complete problems
Levchenkov, V.S.
Doklady Akademii Nauk, 2001, 376 (02) : 175 - 178
[7] Decidability of NP-Complete Problems
A. A. Vagis
A. M. Gupal
Cybernetics and Systems Analysis, 2022, 58 : 914 - 916
[8] Inverse problems of some NP-complete problems
Huang, SM
ALGORITHMIC APPLICATIONS IN MANAGEMENT, PROCEEDINGS, 2005, 3521 : 422 - 426
[9] On simplified NP-complete variants of MONOTONE 3-SAT
Darmann, Andreas
Doecker, Janosch
DISCRETE APPLIED MATHEMATICS, 2021, 292 : 45 - 58
[10] Solving np complete problems in proteomics.
Beavis, RC
ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2004, 227 : U110 - U111