{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"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":28,"n_cols":5,"rows_kept":28,"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],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[12,2,12,3],[15,2,15,3],[17,2,17,3],[17,4,17,5],[18,2,18,3],[18,4,18,5],[19,2,19,3],[20,2,20,3],[21,2,21,3],[22,2,22,3],[23,2,23,3],[25,2,25,3],[26,2,26,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466136803316"]
[null,null,"Titolo",null,"Lectures on proof verification and approximation algorithms / / Ernst W. Mayr, Hans Jurgen Promel, Angelika Steger (eds.)"]
[null,null,"Pubbl/distr/stampa",null,"Berlin ; ; Heidelberg : , : Springer, , [1998]"]
[{"$nulls":4},"Â©1998"]
[null,null,"ISBN",null,"3-540-69701-2"]
[null,null,"Edizione",null,"[1st ed. 1998.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 348 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science ; ; 1367"]
[null,null,"Disciplina",null,"003.54"]
[null,null,"Soggetti",null,"Computer software"]
[{"$nulls":4},"Information theory"]
[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","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"to the theory of complexity and approximation algorithms -- to randomized algorithms -- Derandomization -- Proof checking and non-approximability -- Proving the PCP-Theorem -- Parallel repetition of MIP(2,1) systems -- Bounds for approximating MaxLinEq3-2 and MaxEkSat -- Deriving non-approximability results by reductions -- Optimal non-approximability of MaxClique -- The hardness of approximating set cover -- Semidefinite programming and its applications to approximation algorithms -- Dense instances of hard optimization problems -- Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces."]
[null,null,null,"Sommario/riassunto","During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximability. This textbook-like tutorial is a coherent and essentially self-contained presentation of the enormous recent progress facilitated by the interplay between the theory of probabilistically checkable proofs and aproximation algorithms. The basic concepts, methods, and results are presented in a unified way to provide a smooth introduction for newcomers. These lectures are particularly useful for advanced courses or reading groups on the topic."]
[null,"2.","Record Nr.",null,"UNINA9910291754803321"]
[null,null,"Titolo",null,"INTERMAG : 2018 IEEE International Magnetics Conference : 23-27 April 2018, Singapore / / Institute of Electrical and Electronics Engineers"]
[null,null,"Pubbl/distr/stampa",null,"Piscataway, New Jersey : , : Institute of Electrical and Electronics Engineers, , 2018"]
[null,null,"ISBN",null,"1-5386-6425-9"]
[null,null,"Descrizione fisica",null,"1 online resource (840 pages)"]
[null,null,"Disciplina",null,"538.4"]
[null,null,"Soggetti",null,"Magnetic materials"]
[{"$nulls":4},"Magnetic devices"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]