P versus NP and Computability Theoretic Constructions in Complexity Theory over Algebraic Structures
This is a preview. Log in through your library . Abstract We show that there is a structure of countably infinite signature with $P = N_{2}P$ and a structure of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback