标签polynomial-time - 这是页3 - GeneraCodice

Is longest-path with a specific source and destination impossible in polynomial time?

https://www.generacodice.com/cn/articolo/2463698/is-longest-path-with-a-specific-source-and-destination-impossible-in-polynomial-time
  graph-traversal  -  algorithm-analysis  -  graphs  -  polynomial-time
cs.stackexchange cs.stackexchange

是否有一种有效的算法来确定随机选择的大整数不能被某个集合中的任何整数整除的概率？

https://www.generacodice.com/cn/articolo/2461964/是否有一种有效的算法来确定随机选择的大整数不能被某个集合中的任何整数整除的概率
  probability-theory  -  randomized-algorithms  -  polynomial-time
cs.stackexchange cs.stackexchange

Polynomially related encodings

https://www.generacodice.com/cn/articolo/2461872/polynomially-related-encodings
  complexity-theory  -  np-complete  -  time-complexity  -  polynomial-time
cs.stackexchange cs.stackexchange

0-1没有重复的背包

https://www.generacodice.com/cn/articolo/2461415/0-1没有重复的背包
  time-complexity  -  knapsack-problems  -  polynomial-time  -  pseudo-polynomial
cs.stackexchange cs.stackexchange

多项式时间可验证哪些类型的字符串属性？

https://www.generacodice.com/cn/articolo/2461333/多项式时间可验证哪些类型的字符串属性
  polynomial-time
cs.stackexchange cs.stackexchange

Understanding definition of NP and co-NP

https://www.generacodice.com/cn/articolo/2460567/understanding-definition-of-np-and-co-np
  complexity-theory  -  np  -  polynomial-time
cs.stackexchange cs.stackexchange

如果p= np，则在多项式时间运行的算法

https://www.generacodice.com/cn/articolo/2458475/如果p-np-则在多项式时间运行的算法
  time-complexity  -  algorithms  -  decision-problem  -  p-vs-np  -  polynomial-time
cs.stackexchange cs.stackexchange

证明该功能不是多项式的输入似乎有缺陷的多项式时间

https://www.generacodice.com/cn/articolo/2455107/证明该功能不是多项式的输入似乎有缺陷的多项式时间
  complexity-theory  -  time-complexity  -  polynomial-time
cs.stackexchange cs.stackexchange

np-c或p细节中定义的语言是否？

https://www.generacodice.com/cn/articolo/2454736/np-c或p细节中定义的语言是否
  complexity-theory  -  np-complete  -  time-complexity  -  polynomial-time
cs.stackexchange cs.stackexchange

How undecidable is it whether a given Turing machine runs in polynomial time?

https://www.generacodice.com/cn/articolo/1809275/how-undecidable-is-it-whether-a-given-turing-machine-runs-in-polynomial-time
  computability  -  undecidability  -  polynomial-time
cs.stackexchange cs.stackexchange
发现结果: 298
scroll top