• Meta-optimalizace solveru systému generálního a hlavního klíče 

      Autor: Jumurov Ruslan; Vedoucí práce: Černoch Radomír; Oponent práce: Šedivý Jan
      Many practical problems are NP-Hard (or NP-Complete), for which best algorithms may guarantee only exponential worth-case time complexity, if P != NP. Typically, these algorithms can not do better, but several types of ...