{"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":38,"n_cols":5,"rows_kept":38,"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],[7,2,7,3],[9,2,9,3],[11,2,11,3],[12,2,12,3],[15,2,15,3],[15,4,15,5],[16,2,16,3],[16,4,16,5],[17,2,17,3],[17,4,17,5],[18,2,18,3],[20,2,20,3],[21,2,21,3],[22,2,22,3],[23,2,23,3],[24,2,24,3],[27,2,27,3],[28,2,28,3],[32,2,32,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISALENTO991001219519707536"]
[null,null,"Autore",null,"Martini, Umberto"]
[null,null,"Titolo",null,"Management dei sistemi territoriali : gestione di marketing delle destinazioni turistiche / Umberto Martini ; con la presentazione di Mariangela Franch ; una postilla di Claudio Baccarani"]
[null,null,"Pubbl/distr/stampa",null,"Torino : Giappichelli, 2005"]
[null,null,"ISBN",null,"8834853555"]
[null,null,"Descrizione fisica",null,"xix, 249 p. ; 24 cm"]
[null,null,"Collana",null,"Produzione e l'organizzazione dei viaggie del turismo ; 10"]
[null,null,"Disciplina",null,"658"]
[{"$nulls":4},"338.4791068"]
[null,null,"Soggetti",null,"Aziende turistiche - Gestione"]
[{"$nulls":4},"Turismo - Marketing"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Nota di bibliografia","Con riferimenti bibliografici"]
[null,"2.","Record Nr.",null,"UNINA9910788758403321"]
[null,null,"Autore",null,"Gilman Jane <1945->"]
[null,null,"Titolo",null,"Two-generator discrete subgroups of PSL (2, R) / / Jane Gilman"]
[null,null,"Pubbl/distr/stampa",null,"Providence, Rhode Island : , : American Mathematical Society, , 1995"]
[{"$nulls":4},"©1995"]
[null,null,"ISBN",null,"1-4704-0140-1"]
[null,null,"Descrizione fisica",null,"1 online resource (221 p.)"]
[null,null,"Collana",null,"Memoirs of the American Mathematical Society, , 0065-9266 ; ; Volume 117, Number 561"]
[null,null,"Disciplina",null,"515/.223"]
[null,null,"Soggetti",null,"Fuchsian groups"]
[{"$nulls":4},"Kleinian groups"]
[{"$nulls":4},"Teichmüller spaces"]
[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","\"September 1995, volume 117, number 561 (fourth of 5 numbers).\""]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"\"\"Contents\"\"; \"\"I: Introduction\"\"; \"\"1 Introduction\"\"; \"\"1.1 Overview Intersecting Axes\"\"; \"\"1.2 Overview of the intertwining cases\"\"; \"\"1.3 Why an algorithm is needed\"\"; \"\"2 The Acute Triangle Theorem\"\"; \"\"2.1 Nielsen equivalence\"\"; \"\"2.2 Idea of proof: Acute triangle theorem\"\"; \"\"2.3 Labeling Conventions\"\"; \"\"2.4 Ascending order conventions\"\"; \"\"2.5 The Triangle Algorithm\"\"; \"\"2.6 Q and the last triangle along A\"\"; \"\"2.7 Combining triangle algorithm steps\"\"; \"\"2.8 The sides and heights converge to 0\"\"; \"\"2.9 Acute triangle theorem: proof\"\"; \"\"3 Discreteness Theorem Proof Outline\"\""]
[{"$nulls":4},"\"\"3.1 The Discreteness Theorem\"\"\"\"3.2 Discreteness theorem\"\"; \"\"3.3 Geometric equivalence theorems\"\"; \"\"II: Preliminaries\"\"; \"\"4 Triangle Groups and their Tilings\"\"; \"\"4.1 Basic facts about triangle groups\"\"; \"\"4.2 Minimal tiling distances\"\"; \"\"4.3 The wedge at a vertex\"\"; \"\"4.4 Proofs of lemmas and theorems\"\"; \"\"4.5 Additional Notation\"\"; \"\"4.6 Distances in the extended wedge\"\"; \"\"5 Pentagons\"\"; \"\"5.1 Constructing the pentagon, P[sub(A,B)]\"\"; \"\"5.2 Notation\"\"; \"\"5.3 Applying the Poincare Polygon Theorem\"\"; \"\"5.4 Pentagon Tilings\"\"; \"\"5.5 Distances in the shingling\"\""]
[{"$nulls":4},"\"\"8.4 Pentagon distances (2,3, n) t = 3 k = 3\"\"; \"\"9 Nielsen Eq: (2,3, n) t = 3;  k = 3\"\"; \"\"9.1 Introduction\"\"; \"\"9.2 Types of triples: distances\"\"; \"\"9.3 Locating t[sub(2)] and t[sub(3)]\"\"; \"\"10 Nielsen Eq: (2,4, n) t = 2;  k = 2\"\"; \"\"10.1 Introduction\"\"; \"\"10.2 Types of triples\"\"; \"\"10.3 Location of t[sub(1)],t[sub(2)] and t[sub(3)]\"\"; \"\"11 Pentagon t = 9 & 2â€?2 "]
[{"$nulls":4},"Spectrum\"\"; \"\"11.1 Step 1: Label the wedge\"\"; \"\"11.2 Step 2: Double and Extend\"\"; \"\"11.3 Step 3: Drop perpendiculars\"\"; \"\"11.4 The twoâ€?two spectrum\"\"; \"\"11.5 More distance computations\"\"; \"\"11.6 Distances to qÂ?[sub(0)]\"\""]
[{"$nulls":4},"\"\"11.7 Locate three order two points\"\"\"\"12 The Seven & Geometric Eq t = 9\"\"; \"\"12.1 Introduction\"\"; \"\"12.2 The variation of h and b\"\"; \"\"12.3 Rule out a seven on the Î² side\"\"; \"\"12.4 Rule out a seven on the D side\"\"; \"\"12.5 Interior sevens\"\"; \"\"12.6 Notation\"\"; \"\"12.7 Geometric equivalence (2,3, 7) t = 9;  k = 2\"\"; \"\"13 Discreteness Theorem Proof\"\"; \"\"13.1 The Proof of the Discreteness Theorem\"\"; \"\"13.2 The proof of sufficiency\"\"; \"\"IV: The Real Number Algorithm and the Turing Machine Algorithm\"\"; \"\"14 Forms of the Algorithm\"\"; \"\"14.1 What is an algorithm?\"\""]
[{"$nulls":4},"\"\"14.2 The Elliptic Order Algorithm\"\""]