{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"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":19,"n_cols":5,"rows_kept":19,"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],[5,2,5,3],[6,2,6,3],[9,2,9,3],[13,2,13,3],[15,2,15,3],[16,2,16,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISALENTO991003189559707536"]
[null,null,"Autore",null,"Dietzfelbinger, Martin"]
[null,null,"Titolo",null,"Primality testing in polynomial time : from randomized algorithms to \"primes is in p\" / Martin Dietzfelbinger"]
[null,null,"Pubbl/distr/stampa",null,"Berlin : Springer, 2004"]
[null,null,"ISBN",null,"3540403442"]
[null,null,"Descrizione fisica",null,"x, 147 p. ; 23 cm"]
[null,null,"Collana",null,"Lecture notes in computer science Tutorial"]
[{"$nulls":4},"Lecture notes in computer science ; 3000"]
[{"$nulls":4},"Lecture notes in computer science, 0302-9743 ; 3000. Tutorial"]
[null,null,"Classificazione",null,"AMS 68W"]
[{"$nulls":4},"AMS 11A51"]
[{"$nulls":4},"AMS 11-04"]
[{"$nulls":4},"LC QA246.D54"]
[null,null,"Soggetti",null,"Numbers, Prime"]
[{"$nulls":4},"Polynomials"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (p. [143]-144) and index"]