Abstract
The P =?NP problem has provided much of the primary motivation for developments in structural complexity theory. Recent results show that even after twenty years, contributions to the P =?NP problem, as well as other problems, still inspire new efforts. The purpose of this talk is to explain some of these results to theoreticians who do not work in structural complexity theory.
Cite
CITATION STYLE
Book, R. V. (1992). Relativizations of the P=? NP and other Problems: Some developments in structural complexity theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 650 LNCS, pp. 175–186). Springer Verlag. https://doi.org/10.1007/3-540-56279-6_70
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
