Classi di complessità P e NP: differenze tra le versioni
Contenuto cancellato Contenuto aggiunto
Inserisco e correggo wikilink |
m →Bibliografia: fix parametri in template cita using AWB |
||
Riga 27:
== Bibliografia ==
* {{cita libro|autore=[[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ronald L. Rivest]], e [[Clifford Stein]]|titolo=[[Introduzione agli algoritmi]]|ed=2|editore=McGraw-Hill|anno=2005|
* {{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
* {{en}} {{Cita libro|autore=[[Christos Papadimitriou]]|anno=1993|titolo=Computational Complexity|editore=Addison Wesley|edizione=1st|
* {{en}} {{Cita pubblicazione
|url = http://cacm.acm.org/magazines/2009/9/38904-the-status-of-the-p-versus-np-problem/fulltext
Riga 38:
|autore = Lance Fortnow
|data = settembre 2009
|
|volume = 52
|number = 9
| |||