Classi di complessità P e NP: differenze tra le versioni
Contenuto cancellato Contenuto aggiunto
"tuttora" -> "tutt'ora" (primo rigo) |
m Bot: fix citazione web (v. discussione) |
||
Riga 30:
* {{en}} A. S. Fraenkel and D. Lichtenstein, Computing a perfect strategy for n*n chess requires time exponential in n, Proc. 8th Int. Coll. ''Automata, Languages, and Programming'', Springer LNCS 115 (1981) 278–293 and ''J. Comb. Th. A'' 31 (1981) 199–214.
* {{en}} E. Berlekamp and D. Wolfe, Mathematical Go: Chilling Gets the Last Point, A. K. Peters, 1994. D. Wolfe, Go endgames are hard, MSRI Combinatorial Game Theory Research Worksh., 2000.
* {{en}} [[Neil Immerman]]. Languages Which Capture Complexity Classes. ''15th ACM STOC Symposium'', pp. 347–354. 1983.
* {{en}} [[John Markoff]], [http://www.nytimes.com/2009/10/08/science/Wpolynom.html?_r=1 "Prizes Aside, the P-NP Puzzler Has Consequences"], The New York Times, October 8, 2009
* {{Cita libro|autore=[[Christos Papadimitriou]]|anno=1993|titolo=Computational Complexity|editore=Addison Wesley|edizione=1st|isbn=0-201-53082-1|capitolo=Chapter 14: On P vs. NP|pagine=329–356|lingua=en}}
Riga 52:
== Collegamenti esterni ==
*
*
* {{MathWorld|PVersusNPProblem|problema P vs. NP}}
* {{MathWorld|P-Problem|Problema di classe P}}
| |||