We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is ≤P T -complete but not ≤P tt -complete. We provide fairly thorough analyses of the hypotheses that we introduce.
» Authenticated Encryption Relations among Notions and Analysis of the Generic Composition P...
» Swingup control for nlink planar robot with single passive joint using the notion of virtu...
