![NP-complete problems / Analysis of algorithms / Computability theory / Complexity classes / Parameterized complexity / Dominating set / Time complexity / Computable function / Parameter / Theoretical computer science / Computational complexity theory / Applied mathematics NP-complete problems / Analysis of algorithms / Computability theory / Complexity classes / Parameterized complexity / Dominating set / Time complexity / Computable function / Parameter / Theoretical computer science / Computational complexity theory / Applied mathematics](https://www.pdfsearch.io/img/6ed2b8766bc091caf9cf236326846502.jpg)
| Document Date: 2014-02-04 08:14:43 Open Document File Size: 276,74 KBShare Result on Facebook
City Berlin / Beijing / / Company Fixed-Parameter Tractability / / Currency pence / LTL / / IndustryTerm trivial brute-force algorithms / model-checking algorithm / obvious brute-force search algorithm / typical applications / bounded search trees / approximation algorithms / / Position scientist / university official / / ProgrammingLanguage SQL / / Technology approximation algorithms / An algorithm / trivial brute-force algorithms / model-checking algorithm / relational database / obvious brute-force search algorithm / /
SocialTag |