@article{PDML_1982___1B_15_0, author = {Stern, Jacques}, title = {Quelques aspects du probl\`eme $P=NP$}, journal = {Publications du D\'epartement de math\'ematiques (Lyon)}, pages = {15--26}, publisher = {Universit\'e Claude Bernard - Lyon 1}, number = {1B}, year = {1982}, mrnumber = {720724}, zbl = {0534.68029}, language = {fr}, url = {http://www.numdam.org/item/PDML_1982___1B_15_0/} }
Stern, Jacques. Quelques aspects du problème $P=NP$. Publications du Département de mathématiques (Lyon), no. 1B (1982), pp. 15-26. http://www.numdam.org/item/PDML_1982___1B_15_0/
[1] The design and analysis of computer algorithms, Addison-Wesley, Reading (1974). | MR | Zbl
, , ,[2] Relativizations of the question, SIAM J. Comput 4, (1975) 431-442. | MR | Zbl
, , ,[3] A second step towards the polynomial hierarchy, Proc. 17 th Ann. Symp. on Foundations of Computer Science, IEEE Computer Society Long Beach (1976) 71-75. | MR | Zbl
, ,[4] Computers and intractability. A guide to the theory of NP-completeness, W.H. Freeman, San Francisco (1979). | MR | Zbl
, ,[5] Introduction to automata theory, languages and computation, Addison-Wesley, Reading (1979). | MR | Zbl
, ,[6]
, résultats non publiés.[7]
, Séminaire : Algorithmes et complexité, Université de CAEN (1982)[8] The polynomial time hierarchy, Theor. Comput. Sci. 3 (1976) 1-22. | MR | Zbl
,