中国
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
完整文章
类别
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
你写
用户
登录
登记
找回密码
标签
语言标签
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
标签polynomial-time - 这是页10 - GeneraCodice
$DTIME(f(n)) \subset of DSPACE(f(n))$
https://www.generacodice.com/cn/articolo/1600193/dtime-f-n-subset-of-dspace-f-n
complexity-theory
-
time-complexity
-
polynomial-time
cs.stackexchange
Time complexity for this simple loop
https://www.generacodice.com/cn/articolo/1600166/time-complexity-for-this-simple-loop
time-complexity
-
algorithm-analysis
-
runtime-analysis
-
polynomial-time
cs.stackexchange
NP Class Definition of a Certificate
https://www.generacodice.com/cn/articolo/1600160/np-class-definition-of-a-certificate
np
-
nondeterminism
-
polynomial-time
cs.stackexchange
Polynomial-Time Reduction
https://www.generacodice.com/cn/articolo/1599450/polynomial-time-reduction
np-complete
-
polynomial-time
cs.stackexchange
Time complexity of sum of $2^n$ values of polynomials
https://www.generacodice.com/cn/articolo/1599443/time-complexity-of-sum-of-2-n-values-of-polynomials
time-complexity
-
polynomial-time
cs.stackexchange
Class P is closed under concatenation
https://www.generacodice.com/cn/articolo/1598502/class-p-is-closed-under-concatenation
complexity-theory
-
closure-properties
-
polynomial-time
cs.stackexchange
Constructing an optimal solution to bin packing using a “magical function” $\phi$
https://www.generacodice.com/cn/articolo/1598060/constructing-an-optimal-solution-to-bin-packing-using-a-magical-function-phi
complexity-theory
-
packing
-
time-complexity
-
algorithms
-
polynomial-time
cs.stackexchange
Defining polynomial hierarchy with oracle machines and quantifiers
https://www.generacodice.com/cn/articolo/1597399/defining-polynomial-hierarchy-with-oracle-machines-and-quantifiers
polynomial-time
-
oracle-machines
cs.stackexchange
Adding the requirement of linear time on infinitely many inputs into the class $P$
https://www.generacodice.com/cn/articolo/1597305/adding-the-requirement-of-linear-time-on-infinitely-many-inputs-into-the-class-p
complexity-theory
-
turing-machines
-
computability
-
time-complexity
-
polynomial-time
cs.stackexchange
For some $n$, how can we check whether there exists $a,b \in \mathbb{N}$ such that $a^b = n$ in polynomial time?
https://www.generacodice.com/cn/articolo/1595757/for-some-n-how-can-we-check-whether-there-exists-a-b-in-mathbb-n-such-that-a-b-n-in-polynomial-time
complexity-theory
-
polynomial-time
cs.stackexchange
«
7
8
9
10
11
12
»
发现结果: 298