Even在论文《On The Complexity of Timetable And Multi Commodity Flow Problems》,第一次证明了课表问题是NP完全的.在国内,清华大学于1984年在《清华大学学报(... 范玉玲 - 山东师范大学 被引量: 15发表: 0年 Effects of multi-annual climate variability on the hydrodynamic evolution (1833 to present) in...
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem We find that relevance-bounded learning allows better runtime bounds than size-bounded learning on structurally restricted constraint satisfaction problems. Even......
As a side result, we obtain that the complexity of the QBE/definability problems for CQs of treewidth k is EXPTIME-complete for each k > 1. The second relaxation is based on the idea of "desynchronizing" direct products, which characterizes QBE/definability for unions of CQs and reduces ...
This is the first complexity result concerningthe problem to our knowledge. An iterative algorithm based on blocks ofconsecutive resolved marker loci (called... J Li,T Jiang - 《Journal of Bioinformatics & Computational Biology》 被引量: 139发表: 2008年 Islands of Tractability for Parsimony Haplot...
As a consequence, any complexity class with certain natural closure properties possesses either complete problems or no easiest hard problems. A further corollary is that, assuming P ≠ NP, the partial ordering of the polynomial time degrees of NP-sets is not complete, and that there are no ...
Whale Optimization Algorithm based on atom-like structure differential evolution Time complexity analysis of WOAAD Convergence analysis of WOAAD The experiments and comparisons Engineering design problems Conclusions Data availability References Funding Author information Ethics declarations Additional information Sup...
Using LV-reductions we prove that the exponential-time hypothesis is false if and only if all SAT(S) problems are subexponential. This is extended to cover degree-bounded SAT(S) problems. Hence, using clone theory, we obtain a solid understanding of the complexity of SAT(S) with CV- and...
Proposition 2 states the time complexity of the algorithm. Proposition 2 If the standard setting is used, Algorithm 1 can be performed in polynomial time in terms of m, log2p, and log2p′. Proof Steps 1 and 2 calculate the Hermite normal forms; this involves the most time-...
A common way to evaluate the time complexity of an algorithm is to use asymptotic worst-case analysis and to express the cost of the computation as a function of the size of the input. However, for an incremental algorithm this kind of analysis is sometimes not very informative. (By an ...
(2) The complexity of the human–water relationship is the root of many difficult problems, and forming a sound disciplinary system of human–water relationship discipline is the key to breaking through these difficult problems. (3) The Yellow River water distribution scheme based on human–water...