Deutsch
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
Vollständige Artikel
Kategorien
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
Du schreibst
Benutzer
Anmeldung
Anmeldung
Passwort-Wiederherstellung
Stichworte
Sprachtags
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
Tag parameterized-complexity - Dies ist Seite 1 - GeneraCodice
Gibt es ein NP-Hard-Problem, für den kein fester Parameter-traktiver Algorithmus vorhanden ist?
https://www.generacodice.com/de/articolo/2477460/gibt-es-ein-np-hard-problem-fuer-den-kein-fester-parameter-traktiver-algorithmus-vorhanden-ist
complexity-theory
-
np-hard
-
parameterized-complexity
cs.stackexchange
Gibt es noch bekannte W [3] oder W [3] -Hard-Probleme?
https://www.generacodice.com/de/articolo/2474852/gibt-es-noch-bekannte-w-3-oder-w-3-hard-probleme
complexity-theory
-
complexity-classes
-
parameterized-complexity
cs.stackexchange
Schätzen Sie P in Amdahls Gesetz theoretisch und in der Praxis
https://www.generacodice.com/de/articolo/2462289/schaetzen-sie-p-in-amdahls-gesetz-theoretisch-und-in-der-praxis
concurrency
-
parallel-computing
-
parameterized-complexity
-
multi-tasking
cs.stackexchange
Determine smallest possible parameter set for FPT
https://www.generacodice.com/de/articolo/1613180/determine-smallest-possible-parameter-set-for-fpt
complexity-theory
-
parameterized-complexity
cs.stackexchange
Parametrized reduction from 3-SAT to Independent Set to lower bound running time under ETH assumption
https://www.generacodice.com/de/articolo/1612670/parametrized-reduction-from-3-sat-to-independent-set-to-lower-bound-running-time-under-eth-assumption
complexity-theory
-
3-sat
-
parameterized-complexity
cs.stackexchange
Is model checking PSpace-hard *in formula size*?
https://www.generacodice.com/de/articolo/1610978/is-model-checking-pspace-hard-in-formula-size
complexity-theory
-
model-checking
-
linear-temporal-logic
-
parameterized-complexity
cs.stackexchange
Why is dominating set in $W[2]$, but independent set in $W[1]$
https://www.generacodice.com/de/articolo/1604337/why-is-dominating-set-in-w-2-but-independent-set-in-w-1
complexity-theory
-
graphs
-
parameterized-complexity
cs.stackexchange
Relationship between complexity classes XP and W[1]?
https://www.generacodice.com/de/articolo/1603743/relationship-between-complexity-classes-xp-and-w-1
complexity-theory
-
complexity-classes
-
parameterized-complexity
cs.stackexchange
Exhaustive search algorithm solving vertex cover of size $k$ in time $2^{k}n^{O(1)}$?
https://www.generacodice.com/de/articolo/1600152/exhaustive-search-algorithm-solving-vertex-cover-of-size-k-in-time-2-k-n-o-1
np-complete
-
parameterized-complexity
cs.stackexchange
Why does $W[1] = A[1]$ hold?
https://www.generacodice.com/de/articolo/1598486/why-does-w-1-a-1-hold
complexity-theory
-
parameterized-complexity
cs.stackexchange
«
1
2
3
4
5
6
»
Gefundene Ergebnisse: 51