Return to search

NP vyhledávací problémy / NP vyhledávací problémy

Title: NP search problems Author: Tomáš Jirotka Department: Department of Algebra Supervisor: Prof. RNDr. Jan Krajíček, DrSc. Abstract: The thesis summarizes known results in the field of NP search pro- blems. We discuss the complexity of integer factoring in detail, and we propose new results which place the problem in known classes and aim to separate it from PLS in some sense. Furthermore, we define several new search problems. Keywords: Computational complexity, TFNP, integer factorization. 1

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:300252
Date January 2011
CreatorsJirotka, Tomáš
ContributorsKrajíček, Jan, Pudlák, Pavel
Source SetsCzech ETDs
LanguageEnglish
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/masterThesis
Rightsinfo:eu-repo/semantics/restrictedAccess

Page generated in 0.0017 seconds