{"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":67,"n_cols":5,"rows_kept":67,"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],[11,2,11,3],[12,2,12,3],[17,2,17,3],[17,4,17,5],[18,2,18,3],[18,4,18,5],[19,2,19,3],[19,4,19,5],[20,2,20,3],[22,2,22,3],[23,2,23,3],[25,2,25,3],[30,2,30,3],[31,2,31,3],[36,2,36,3],[36,4,36,5],[37,2,37,3],[37,4,37,5],[38,2,38,3],[39,2,39,3],[42,2,42,3],[43,2,43,3],[44,2,44,3],[45,2,45,3],[46,2,46,3],[58,2,58,3],[59,2,59,3],[63,2,63,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996390902903316"]
[null,null,"Autore",null,"Gray Andrew <1633-1656.>"]
[null,null,"Titolo",null,"Great and precious promises, or, Some sermons concerning the promises, and the right application thereof [[electronic resource] ] : whereunto are added some other concerning the usefulnesse of faith in advancing sanctification. As also three more concerning the faith of assurance. / / by Mr. Andrew Gray ."]
[null,null,"Pubbl/distr/stampa",null,"Edinburgh, : Printed by Andrew Anderson, 1670"]
[null,null,"Edizione",null,"[All being revised since his death by some friends.]"]
[null,null,"Descrizione fisica",null,"[6], 210 p"]
[null,null,"Soggetti",null,"Sermons, Scottish - 17th century"]
[{"$nulls":4},"God - Promises"]
[{"$nulls":4},"Faith"]
[{"$nulls":4},"Sanctification"]
[{"$nulls":4},"Assurance (Theology)"]
[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","Imperfect: tightly bound, with print show-through and some loss of print."]
[{"$nulls":4},"Reproduction of original in the British Library."]
[null,null,null,"Sommario/riassunto","eebo-0166"]
[null,"2.","Record Nr.",null,"UNINA9910707216303321"]
[null,null,"Autore",null,"Christman Robert A (Robert Adam), <1924->"]
[null,null,"Titolo",null,"Geology and thorium deposits of the Wet Mountains, Colorado : a progress report / / by R.A. Christman [and three others]"]
[null,null,"Pubbl/distr/stampa",null,"Washington, D.C. : , : United States Department of the Interior, Geological Survey, , 1959"]
[{"$nulls":4},"Washington, D.C. : , : Government Printing Office"]
[null,null,"Descrizione fisica",null,"1 online resource (iv, 491-535 pages, 2 pages of plates) : illustrations, maps, charts"]
[null,null,"Collana",null,"Contributions to economic geology"]
[{"$nulls":4},"Geological Survey bulletin ; ; 1072-H"]
[null,null,"Soggetti",null,"Geology - Colorado - Wet Mountains"]
[{"$nulls":4},"Thorium ores - Colorado - Wet Mountains"]
[{"$nulls":4},"Geology"]
[{"$nulls":4},"Thorium ores"]
[{"$nulls":4},"Colorado Wet Mountains"]
[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","\"This report concerns work done partly on behalf of the U.S. Atomic Energy Commission and is published with the permission of the Commission\""]
[{"$nulls":4},"Title from title screen (viewed July 23, 2014)."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (pages 532-533) and index."]
[null,"3.","Record Nr.",null,"UNINA9910484749503321"]
[null,null,"Titolo",null,"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings / / edited by Maria Serna, Ronen Shaltiel, Klaus Jansen, José Rolim"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010"]
[null,null,"ISBN",null,"1-280-38852-8"]
[{"$nulls":4},"9786613566447"]
[{"$nulls":4},"3-642-15369-0"]
[null,null,"Edizione",null,"[1st ed. 2010.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIII, 782 p. 54 illus.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 6302"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Computer programming"]
[{"$nulls":4},"Computer networks"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Artificial intelligence - Data processing"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Computer Communication Networks"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Data Science"]
[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,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Contributed Talks of APPROX -- Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem -- Improved Inapproximability for Submodular Maximization -- Approximation Algorithms for the Directed k-Tour and k-Stroll Problems -- Submodular Secretary Problem and Extensions -- Approximation Algorithms for Min-Max Generalization Problems -- Min-Power Strong Connectivity -- The Complexity of Approximately Counting Stable Matchings -- Constant Approximation Algorithms for Embedding "]
[{"$nulls":4},"Graph Metrics into Trees and Outerplanar Graphs -- Approximating Linear Threshold Predicates -- Approximating Sparsest Cut in Graphs of Bounded Treewidth -- On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors -- Vertex Sparsifiers: New Results from Old Techniques -- PTAS for Weighted Set Cover on Unit Squares -- Improved Lower Bounds for the Universal and a priori TSP -- Proximity Algorithms for Nearly-Doubling Spaces -- Matrix Sparsification and the Sparse Null Space Problem -- The Checkpoint Problem -- The Euclidean Distortion of Flat Tori -- Online Embeddings -- Approximation Algorithms for Intersection Graphs -- An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs -- Improved Algorithm for the Half-Disjoint Paths Problem -- Approximate Lasserre Integrality Gap for Unique Games -- Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses -- Maximum Flows on Disjoint Paths -- Approximation Algorithms for Reliable Stochastic Combinatorial Optimization -- How to Schedule When You Have to Buy Your Energy -- Improving Integrality Gaps via Chvátal-Gomory Rounding -- Contributed Talks of RANDOM -- Uniform Derandomization from Pathetic Lower Bounds -- Testing Boolean FunctionIsomorphism -- Better Size Estimation for Sparse Matrix Products -- Low Rate Is Insufficient for Local Testability -- Reconstruction Threshold for the Hardcore Model -- Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners -- Monotonicity Testing and Shortest-Path Routing on the Cube -- Better Gap-Hamming Lower Bounds via Better Round Elimination -- Propagation Connectivity of Random Hypergraphs -- Improved Pseudorandom Generators for Depth 2 Circuits -- The Structure of Winning Strategies in Parallel Repetition Games -- Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries -- Periodicity in Streams -- Rumor Spreading on Random Regular Graphs and Expanders -- On Testing Computability by Small Width OBDDs -- Learning and Lower Bounds for AC 0 with Threshold Gates -- Liftings of Tree-Structured Markov Chains -- Constructive Proofs of Concentration Bounds -- Almost-Euclidean Subspaces of via Tensor Products: A Simple Approach to Randomness Reduction -- Testing Outerplanarity of Bounded Degree Graphs -- Two-Source Extractors Secure against Quantum Adversaries -- Locally Testable vs. Locally Decodable Codes -- Differential Privacy and the Fat-Shattering Dimension of Linear Queries -- Two Theorems on List Decoding -- Delaying Satisfiability for Random 2SAT -- Improved Rounding for Parallel Repeated Unique Games -- A Query Efficient Non-adaptive Long Code Test with Perfect Completeness -- Relativized Worlds without Worst-Case to Average-Case Reductions for NP -- A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field."]
[null,null,null,"Sommario/riassunto","This volume contains the papers presented at the 13th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010) and the 14th International Workshop on Randomization and Computation (RANDOM 2010), which took place concurrently in Universitat Politècnica de Catalunya (UPC) Barcelona, Spain, during September 1-3, 2010. APPROX focuses on algorithmic and complexity issues surrounding the dev- opment of e'cient approximate solutions to computationally di'cult problems, and was the 13th in the series after Aalborg (1998), Berkeley (1999), Sa- brücken (2000), Berkeley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), Boston (2008) and Berkeley (2009). RANDOM is concerned with "]
[{"$nulls":4},"applications of randomness to computational and combinatorial problems, and was the 14th workshop in the - ries following Bologna (1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), Boston (2008), and Berkeley (2009)."]