en
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
Full articles
Categories
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
You write
User
Login
Registration
Password recovery
Tags
Language tags
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
Tag polynomial-time - This is page 4 - GeneraCodice
Algorithms that run in polynomial time if P=NP
https://www.generacodice.com/en/articolo/2458475/algorithms-that-run-in-polynomial-time-if-p-np
time-complexity
-
algorithms
-
decision-problem
-
p-vs-np
-
polynomial-time
cs.stackexchange
Argument in proving that function is not polynomial time in bit length of input seems faulty
https://www.generacodice.com/en/articolo/2455107/argument-in-proving-that-function-is-not-polynomial-time-in-bit-length-of-input-seems-faulty
complexity-theory
-
time-complexity
-
polynomial-time
cs.stackexchange
Does the language defined in the details in NP-C or P?
https://www.generacodice.com/en/articolo/2454736/does-the-language-defined-in-the-details-in-np-c-or-p
complexity-theory
-
np-complete
-
time-complexity
-
polynomial-time
cs.stackexchange
How undecidable is it whether a given Turing machine runs in polynomial time?
https://www.generacodice.com/en/articolo/1809275/how-undecidable-is-it-whether-a-given-turing-machine-runs-in-polynomial-time
computability
-
undecidability
-
polynomial-time
cs.stackexchange
Simple Hamiltonian cycle reduction
https://www.generacodice.com/en/articolo/1615513/simple-hamiltonian-cycle-reduction
np-complete
-
polynomial-time
cs.stackexchange
Number of equivalence classes in $P$
https://www.generacodice.com/en/articolo/1613709/number-of-equivalence-classes-in-p
complexity-theory
-
time-complexity
-
polynomial-time
cs.stackexchange
is $x^{100000000000}$ a “polynomial time”?
https://www.generacodice.com/en/articolo/1613479/is-x-100000000000-a-polynomial-time
polynomial-time
cs.stackexchange
Reduce 4-SAT to 5-SAT
https://www.generacodice.com/en/articolo/1612950/reduce-4-sat-to-5-sat
np-complete
-
satisfiability
-
np-hard
-
time-complexity
-
polynomial-time
cs.stackexchange
Is a “local” version of 3-SAT NP-hard?
https://www.generacodice.com/en/articolo/1612712/is-a-local-version-of-3-sat-np-hard
satisfiability
-
np-hard
-
3-sat
-
polynomial-time
-
2-sat
cs.stackexchange
Polynomial Time reducible explanation
https://www.generacodice.com/en/articolo/1609765/polynomial-time-reducible-explanation
formal-languages
-
reductions
-
polynomial-time
cs.stackexchange
«
1
2
3
4
5
6
»
Results found: 298