Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR12-100 | 23rd July 2012 21:03

NP Search Problems

RSS-Feed




TR12-100
Authors: Tomas Jirotka
Publication: 10th August 2012 08:54
Downloads: 889
Keywords: 


Abstract:

The thesis summarizes known results in the field of NP search problems. 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.



ISSN 1433-8092 | Imprint