{"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":49,"n_cols":5,"rows_kept":49,"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],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[20,2,20,3],[21,2,21,3],[25,2,25,3],[27,2,27,3],[27,4,27,5],[28,2,28,3],[28,4,28,5],[29,2,29,3],[29,4,29,5],[30,2,30,3],[32,2,32,3],[35,2,35,3],[36,2,36,3],[37,2,37,3],[38,2,38,3],[39,2,39,3],[41,2,41,3],[42,2,42,3],[46,2,46,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465784203316"]
[null,null,"Titolo",null,"Computing and Combinatorics [[electronic resource] ] : 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings / / edited by Jie Wang"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001"]
[null,null,"ISBN",null,"3-540-44679-6"]
[null,null,"Edizione",null,"[1st ed. 2001.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIV, 606 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 2108"]
[null,null,"Disciplina",null,"004"]
[null,null,"Soggetti",null,"Discrete mathematics"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Computer communication systems"]
[{"$nulls":4},"Discrete Mathematics"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Computer Graphics"]
[{"$nulls":4},"Computer Communication Networks"]
[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 at the end of each chapters and index."]
[null,null,"Nota di contenuto",null,"Complexity Theory -- Complete Problems for Valiant’s Class of qp-Computable Families of Polynomials -- Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n 4.03) -- On Universally Polynomial Context-Free Languages -- Separating Oblivious and Non-oblivious BPs -- Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws -- Algebraic Properties for P-Selectivity -- Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM -- Computational Biology -- Enhanced Sequence Reconstruction with DNA Microarray Application -- Non-approximability of Weighted Multiple Sequence Alignment -- A Greedy Algorithm for Optimal Recombination -- Computational Geometry -- "]
[{"$nulls":4},"Generating Well-Shaped d-dimensional Delaunay Meshes -- Towards Compatible Triangulations -- An Improved Upper Bound on the Size of Planar Convex-Hulls -- On the Planar Two-Watchtower Problem -- Efficient Generation of Triconnected Plane Triangulations -- Packing Two Disks into a Polygonal Environment -- Maximum Red/Blue Interval Matching with Application -- Computing Farthest Neighbors on a Convex Polytope -- Finding an Optimal Bridge between Two Polygons -- How Good Is Sink Insertion? -- Polynomial Time Algorithms for Three-Label Point Labeling -- Approximation Algorithms for the Watchman Route and Zookeeper’s Problems -- Data Structures and Algorithms -- PC-Trees vs. PQ-Trees -- Stacks versus Deques -- Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences -- Games and Combinatorics -- Competitive Facility Location along a Highway -- Membership for Core of LP Games and Other Games -- Strong Solutions to the Identification Problem -- Area Efficient Exponentiation Using Modular Multiplier/Squarer in GF(2m)1 -- Graph Algorithms and Complexity -- A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms -- Finding the Most Vital Node of a Shortest Path -- Algorithm for the Cost Edge-Coloring of Trees -- Counting H-Colorings of Partial k-Trees -- A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph -- Graph Separators: A Parameterized View -- On Assigning Prefix Free Codes to the Vertices of a Graph -- A New Measure of Edit Distance between Labeled Trees -- A Highly Efficient Algorithm to Determine Bicritical Graphs -- Graph Drawing -- Layered Drawings of Graphs with Crossing Constraints -- On the Validity of Hierarchical Decompositions -- Graph Theory -- Lower Bounds on the Minus Domination and k-Subdomination Numbers -- Edge Connectivity vs Vertex Connectivity in Chordal Graphs -- Changing the Diameter of Graph Products -- Plane Graphs with Acyclic Complex -- On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs -- A Notion of Cross-Perfect Bipartite Graphs -- Some Results on Orthogonal Factorizations -- Cluttered Orderings for the Complete Graph -- Online Algorithms -- Improved On-Line Stream Merging: From a Restricted to a General Setting -- On-Line Deadline Scheduling on Multiple Resources -- Competitive Online Scheduling with Level of Service -- On-Line Variable Sized Covering -- Randomized and Average-Case Algorithms -- On Testing for Zero Polynomials by a Set of Points with Bounded Precision -- A Randomized Algorithm for Gossiping in Radio Networks -- Deterministic Application of Grover’s Quantum Search Algorithm -- Random Instance Generation for MAX 3SAT -- Steiner Trees -- The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points -- AnFPTAS forWeight-Constrained SteinerTrees in Series-Parallel Graphs -- Systems Algorithms and Modeling -- Decidable Approximations on Generalized and Parameterized Discrete Timed Automata -- Multiplicative Adaptive Algorithms for User Preference Retrieval -- Parametric Scheduling for Network Constraints -- A Logical Framework for Knowledge Sharing in Multi-agent Systems -- A Lockout Avoidance Algorithm without Using Time-Stamps for the k-Exclusion Problem -- Computability -- Prefix-Free Languages and Initial Segments of Computably Enumerable Degrees -- Weakly Computable Real Numbers and Total Computable Real Functions -- Turing Computability of a Nonlinear Schrödinger Propagator."]
[null,"2.","Record Nr.",null,"UNINA9910825097703321"]
[null,null,"Autore",null,"Cox David A."]
[null,null,"Titolo",null,"Primes of the form = x² + ny² : Fermat, class field theory, and complex multiplication / / David A. Cox"]
[null,null,"Pubbl/distr/stampa",null,"Hoboken, New Jersey : , : Wiley, , 2013"]
[{"$nulls":4},"©2013"]
[null,null,"ISBN",null,"1-118-40072-0"]
[{"$nulls":4},"1-118-40075-5"]
[{"$nulls":4},"1-118-40074-7"]
[null,null,"Edizione",null,"[Second edition.]"]
[null,null,"Descrizione fisica",null,"1 online resource (419 pages) : illustrations, tables"]
[null,null,"Collana",null,"Pure and Applied Mathematics"]
[null,null,"Disciplina",null,"512.7/23"]
[null,null,"Soggetti",null,"Numbers, Prime"]
[{"$nulls":4},"Mathematics"]
[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","\"Originally published: Primes of the form x² + ny², 1989\"--Title page verso."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"From Fermat to Gauss -- Class field theory -- Complex multiplication -- Additional topics."]
[null,null,null,"Sommario/riassunto","An exciting approach to the history and mathematics of number theory \". . . the author's style is totally lucid and very easy to read . . .the result is indeed a wonderful story.\" – Mathematical Reviews Written in a unique and accessible style for readers of varied mathematical backgrounds, the Second Edition of Primes of the Form p = x 2 + ny 2 details the history behind how Pierre de Fermat's work ultimately gave birth to quadratic reciprocity and the genus theory of quadratic forms. The book also illustrates how results of Euler and Gauss can be fully understood only in the context of class field theory, and in addition, explores a selection of the magnificent formulas of complex multiplication. Primes of the Form p = x 2 + ny 2 , Second Edition focuses on addressing the question of when a prime p is of the form x 2 + ny 2 , which serves as the basis for further discussion of various mathematical topics. This updated edition has several new notable features, including: A well-motivated introduction to the classical formulation of class field theory Illustrations of explicit numerical examples to demonstrate the power of basic theorems in various situations An elementary treatment of quadratic forms and genus theory Simultaneous treatment of elementary and advanced aspects of "]
[{"$nulls":4},"number theory New coverage of the Shimura reciprocity law and a selection of recent work in an updated bibliography Primes of the Form p = x 2 + ny 2 , Second Edition is both a useful reference for number theory theorists and an excellent text for undergraduate and graduate-level courses in number and Galois theory."]