{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":3,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":57,"n_cols":5,"rows_kept":57,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[13,2,13,3],[14,2,14,3],[18,2,18,3],[21,2,21,3],[21,4,21,5],[22,2,22,3],[22,4,22,5],[23,2,23,3],[23,4,23,5],[24,2,24,3],[25,2,25,3],[26,2,26,3],[27,2,27,3],[28,2,28,3],[29,2,29,3],[30,2,30,3],[31,2,31,3],[33,2,33,3],[33,4,33,5],[34,2,34,3],[34,4,34,5],[35,2,35,3],[35,4,35,5],[36,2,36,3],[37,2,37,3],[46,2,46,3],[47,2,47,3],[48,2,48,3],[49,2,49,3],[50,2,50,3],[54,2,54,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910457894303321"]
[null,null,"Autore",null,"Cook William <1957->"]
[null,null,"Titolo",null,"In pursuit of the traveling salesman [[electronic resource] ] : mathematics at the limits of computation / / William J. Cook"]
[null,null,"Pubbl/distr/stampa",null,"Princeton, : Princeton University Press, 2012"]
[null,null,"ISBN",null,"1-283-33977-3"]
[{"$nulls":4},"9786613339775"]
[{"$nulls":4},"1-4008-3959-9"]
[null,null,"Edizione",null,"[Course Book]"]
[null,null,"Descrizione fisica",null,"1 online resource (245 p.)"]
[null,null,"Disciplina",null,"511/.5"]
[null,null,"Soggetti",null,"Traveling salesman problem"]
[{"$nulls":4},"Computational complexity"]
[{"$nulls":4},"Electronic books."]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Front matter -- Contents -- Preface -- 1: Challenges -- 2: Origins of the Problem -- 3: The Salesman in Action -- 4: Searching for a Tour -- 5: Linear Programming -- 6: Cutting Planes -- 7: Branching -- 8: Big Computing -- 9: Complexity -- 10: The Human Touch -- 11: Aesthetics -- 12: Pushing the Limits -- Notes -- Bibliography -- Index"]
[null,null,null,"Sommario/riassunto","\"What is the shortest possible route for a traveling salesman seeking to visit each city on a list exactly once and return to his city of origin? It sounds simple enough, yet the traveling salesman problem is one of the most intensely studied puzzles in applied mathematics--and it has defied solution to this day. In this book, William Cook takes readers on a mathematical excursion, picking up the salesman's trail in the 1800s when Irish mathematician W. R. Hamilton first defined the problem, and venturing to the furthest limits of today's state-of-the-art attempts to solve it. Cook examines the origins and history of the salesman problem and explores its many important applications, from genome sequencing and designing computer processors to arranging music and hunting for planets. He looks at how computers stack up against the traveling salesman problem on a grand scale, and discusses how humans, unaided by computers, go about trying to solve the puzzle. Cook traces the salesman problem to the realms of neuroscience, psychology, and art, and he also challenges readers to tackle the problem themselves. The traveling salesman problem is--literally--a "]
[{"$nulls":4},"$1 million question. That's the prize the Clay Mathematics Institute is offering to anyone who can solve the problem or prove that it can't be done. In Pursuit of the Traveling Salesman travels to the very threshold of our understanding about the nature of complexity, and challenges you yourself to discover the solution to this captivating mathematical problem\"--"]
[null,"2.","Record Nr.",null,"UNISALENTO991002420479707536"]
[null,null,"Autore",null,"Lovera, Romeo"]
[null,null,"Titolo",null,"Grammatica della lingua greca moderna / di Romeo Lovera"]
[null,null,"Pubbl/distr/stampa",null,"Milano : U. Hoepli, 1909"]
[null,null,"Edizione",null,"[2. ed. riveduta, corretta e ampliata]"]
[null,null,"Descrizione fisica",null,"VI, 64 p. ; 15 cm"]
[null,null,"Collana",null,"Manuali Hoepli"]
[null,null,"Disciplina",null,"489"]
[null,null,"Soggetti",null,"Lingua greca moderna - Grammatica"]
[null,null,"Lingua di pubblicazione",null,"Greco Moderno"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"3.","Record Nr.",null,"UNINA9910783129003321"]
[null,null,"Autore",null,"Vickers Brian"]
[null,null,"Titolo",null,"Counterfeiting Shakespeare : evidence, authorship, and John Ford's Funerall elegye / / Brian Vickers [[electronic resource]]"]
[null,null,"Pubbl/distr/stampa",null,"Cambridge : , : Cambridge University Press, , 2002"]
[null,null,"ISBN",null,"1-107-12871-4"]
[{"$nulls":4},"1-280-16019-5"]
[{"$nulls":4},"0-511-11843-0"]
[{"$nulls":4},"1-139-14630-0"]
[{"$nulls":4},"0-511-06671-6"]
[{"$nulls":4},"0-511-06040-8"]
[{"$nulls":4},"0-511-30540-0"]
[{"$nulls":4},"0-511-48404-6"]
[{"$nulls":4},"0-511-06884-0"]
[null,null,"Descrizione fisica",null,"1 online resource (xxvii, 568 pages) : digital, PDF file(s)"]
[null,null,"Disciplina",null,"822.3/3"]
[null,null,"Soggetti",null,"Poetry - Authorship"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Title from publisher's bibliographic system (viewed on 05 Oct 2015)."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (p. 554-562) and index."]
[null,null,"Nota di contenuto",null,"Prologue: Gary Taylor finds a poem -- ; pt. I. Donald Foster's 'Shakespearean' Construct. ; 1. 'W. S.' and the Elegye for William Peter. ; 2. Parallels? Plagiarisms? ; 3. Vocabulary and diction. ; 4. Grammar: 'the Shakespearean \"who\"'. ; 5. Prosody, punctuation, pause patterns. ; 6. Rhetoric: 'the Shakespearean \"hendiadys\"'. ; 7. Statistics and inference. ; 8. A poem 'indistinguishable from Shakespeare'? -- ; pt. II. John Ford's 'Funerall Elegye'. ; 9. Ford's writing career: poet, moralist, playwright. ; 10. Ford and the Elegye's 'Shakespearean diction'. ; 11. The Funerall Elegye in its Fordian context. Epilogue: The politics of attribution -- ; App. I. The text of A Funerall Elegye -- ; App. II. Verbal parallels between A Funerall Elegye and Ford's poems."]
[null,null,null,"Sommario/riassunto","'Counterfeiting' Shakespeare addresses the fundamental issue of what Shakespeare actually wrote, and how this is determined. In recent years his authorship has been claimed for two poems, the lyric 'Shall I die?' and A Funerall Elegye. These attributions have been accepted into certain major editions of Shakespeare's works but Brian Vickers argues that both attributions rest on superficial verbal parallels; both use too "]
[{"$nulls":4},"small a sample, ignore negative evidence, and violate basic principles in authorship studies. Through a fresh examination of the evidence, Professor Vickers shows that neither poem has the stylistic and imaginative qualities we associate with Shakespeare. In other words, they are 'counterfeits', in the sense of anonymously authored works wrongly presented as Shakespeare's. He argues that the poet and dramatist John Ford wrote the Elegye: its poetical language (vocabulary, syntax, prosody) is indistinguishable from Ford's, and it contains several hundred close parallels with his work. By combining linguistic and statistical analysis this book makes an important contribution to authorship studies."]