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 complexity-classes - This is page 6 - GeneraCodice
How to understand co-$\mathcal{L}$ where $\mathcal{L}$ is a class of languages
https://www.generacodice.com/en/articolo/2460400/how-to-understand-co-mathcal-l-where-mathcal-l-is-a-class-of-languages
complexity-theory
-
np
-
complexity-classes
cs.stackexchange
Is this a Fixed Parameter Tractable algorithm?
https://www.generacodice.com/en/articolo/2459368/is-this-a-fixed-parameter-tractable-algorithm
complexity-theory
-
time-complexity
-
algorithms
-
complexity-classes
cs.stackexchange
Consequences of the Time Hierarchy Theorem
https://www.generacodice.com/en/articolo/2457509/consequences-of-the-time-hierarchy-theorem
complexity-theory
-
time-complexity
-
complexity-classes
cs.stackexchange
Is there a complexity class QPP?
https://www.generacodice.com/en/articolo/2456379/is-there-a-complexity-class-qpp
complexity-theory
-
time-complexity
-
quantum-computing
-
probabilistic-algorithms
-
complexity-classes
cs.stackexchange
Oracle query’s required
https://www.generacodice.com/en/articolo/2454984/oracle-query-s-required
complexity-theory
-
complexity-classes
-
oracles
cs.stackexchange
Comparing asymptotic running time of two algorithms $\sqrt n$ and $2^{\sqrt{\log _{2}n}}$
https://www.generacodice.com/en/articolo/2447851/comparing-asymptotic-running-time-of-two-algorithms-sqrt-n-and-2-sqrt-log-2-n
time-complexity
-
algorithm-analysis
-
complexity-classes
-
big-o-notation
cs.stackexchange
how to proof ${ NPC \bigcap CO-NPC \ne \varnothing then NP = P ? }$
https://www.generacodice.com/en/articolo/2446881/how-to-proof-npc-bigcap-co-npc-ne-varnothing-then-np-p
complexity-theory
-
np-complete
-
time-complexity
-
p-vs-np
-
complexity-classes
cs.stackexchange
Assume that NP = DTIME(2^sqrt(n)), prove that DTIME(2^sqrt(n)) = DTIME(2^n)
https://www.generacodice.com/en/articolo/2446550/assume-that-np-dtime-2-sqrt-n-prove-that-dtime-2-sqrt-n-dtime-2-n
complexity-theory
-
turing-machines
-
time-complexity
-
np
-
complexity-classes
cs.stackexchange
Does $P/O(1)$ equal to $P$ if solver needs to consider smaller inputs?
https://www.generacodice.com/en/articolo/2445114/does-p-o-1-equal-to-p-if-solver-needs-to-consider-smaller-inputs
complexity-theory
-
time-complexity
-
complexity-classes
cs.stackexchange
Grover's algorithm on probabilistic classical machines
https://www.generacodice.com/en/articolo/2442633/grover-s-algorithm-on-probabilistic-classical-machines
algorithms
-
probabilistic-algorithms
-
complexity-classes
cs.stackexchange
«
3
4
5
6
7
8
»
Results found: 390