“固定参数易解性”的概念、定义、翻译、参考文献-科学参考

单词	固定参数易解性
释义	固定参数易解性 Encyclopedia 理学参数算法释 fixed-parameter tractability固定参数易解性给定参数化问题Q，如果Q能被参数算法A在O(f(k))\|x\|O(1)时间内求解，其中f是一个递归函数，\|x\|是输入实例的大小，k是输入参数，则称参数化问题Q具有固定参数易解性（fixed-paramter tractability）。
随便看	law of marine resources law of mass action law of mass conservation Law of Military Ranks of Song Dynasty law of motion law of multiple proportions law of multiplication law of nations law of nature law of negating law of negating a conjunction law of negating a disjunction law of negating an equivalence law of negating an implication law of neutrality law of parity conservation law of partial pressure law of partial volume law of partial volume of mixed perfect gas law of personality law of planetary distances law of planned and proportional development of national economy law of planned proportional development law of prize law of probability

科学参考收录了854744条科技类词条，基本涵盖了常见科技类参考文献及英语词汇的翻译，是科学学习和研究的有利工具。