“证明复杂性”的概念、定义、翻译、参考文献-科学参考

单词	证明复杂性
释义	证明复杂性 Encyclopedia 理学计算复杂性释 proof complexity证明复杂性证明复杂性（proof complexity）是计算复杂性的研究方向之一，它关注的是逻辑系统中命题的最短证明的长度。 Computer 理论计算机科学可计算性与计算复杂性释文 proof complexity证明复杂性
随便看	full width at half-maximum full-width at half maximum full width at half maximum, FWHM full width at half maximum, half-peak width fully-associative cache fully associative mapping fully automatic operation fully automatic universal testing machine fully characteristic congruence fully characteristic subgroup fully closed mapping fully clothed swimming fully coded field of view fully coherent light fully complete space fully connected network fully connected neural network fully contracted graph fully-controlled inverting circuit fully coverage, basic needs satisfaction, multi-level, sustainability fully decomposable matrix fully depleted CCD fully depleted pn-junction CCD fully determined fully developed flow

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