np

Noun phrase is abbreviated as NP.

名词片语缩写成NP. .

Conclusion: AmB-PBCA-NP modified by polysorbate 80 can pass the blood-brain barrier.

结论: 聚山梨酯-80修饰的 AmB -PBCA-NP具有主动脑靶向作用.

Syntactic stuctures mainly include NP + Aux . V + VP , NP + Neg + Aux. V + VP and NP + Aux.

助动词的句法结构主要有NP+助动词+VP 、 NP+Neg+助动词+VP、NP+助动词等几种,每一格式的内部有一些变化.

Due to its non-linear and NP hard, classical optimizing approaches can not solve it.

由于其所具有的非线性、NP难 等复杂特性, 常规方法难以求解.

The model is in fact a special type of classic location-allocation models and has NP-hard complexity.

该模型是一种特殊形式的选择 —分 配模型,具有NP难性质.

Objective To explore hyperglycemia reaction induced by chemotherapy with NP regimen.

目的探讨“NP”方案化疗引起高血糖反应的情况.

The optimum allocation of process flowchart in a distributed system is an NP-complete problem.

进程流程图在分布式环境下的最优分配是一np难度问题.

Time-table problem a NP-complete problem.

排课表问题是NP - 完全问题.

It is a NP difficult problem to generate complete decision rules based on rough set theory.

摘要针对基于粗糙集理论提取完全的决策规则是NP难 问题,提出一种获取统计意义下的完全的简化规则的算法.

Objectives . To identify roles of notochordal NP in extracellular matrix ( ECM ) metabolism of IVD.

目标:研究IVD代谢过程中细胞外基质 ( ECM ) 的脊索NP所扮演的角色.

Traveling salesman problem ( TSP ) a typical NP complete combinatorial optimum problem.

旅行商问题 ( TSP ) 是典型的NP完全组合优化问题.

The travelling salesman problem was used to illustrate NP-hard problems.

旅行商问题的是用来说明NP难问题.

Traveling salesman problem ( TSP ) is a typical NP complete combinatorial optimum problem.

摘要旅行商问题 ( TSP ) 是典型的NP完全组合优化问题.

The graph coloring problem is a well-known NP-complete problem.

图着色问题是著名的NP - 完全问题.

For general graph, a NP-hard question to get the bondage number or reinforcement number.

对一般的图, 求其绑定数和增强数是NP - 困难问题,在本文中我们求出了两类图的绑定数和增强数.