{"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":16,"n_cols":5,"rows_kept":16,"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],[10,2,10,3],[11,2,11,3],[14,2,14,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466341703316"]
[null,null,"Titolo",null,"Computer Algebra [[electronic resource] ] : EUROCAL’83, European Computer Algebra Conference London, England, March 28–30, 1983 Proceedings / / edited by J. A. van Hulzen"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1983"]
[null,null,"ISBN",null,"3-540-38756-0"]
[null,null,"Edizione",null,"[1st ed. 1983.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIII, 306 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 162"]
[null,null,"Disciplina",null,"518"]
[null,null,"Soggetti",null,"Numerical analysis"]
[{"$nulls":4},"Numerical Analysis"]
[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,"Integration — What do we want from the theory? -- The Euclidean algorithm for Gaussian integers -- Multi polynomial remainder sequence and its application to linear diophantine equations -- Towards mechanical solution of the Kahan ellipse problem I -- Automatically determining symmetries of ordinary differential equations -- Algebraic computation of the statistics of the solution of some nonlinear stochastic differential equations -- Characterization of a linear differential system with a regular singularity -- The Bath Concurrent LISP machine -- The ecology of LISP or the case for the preservation of the environment -- The design of Maple: A compact, portable, and powerful computer algebra system -- LISP compilation viewed as provable semantics preserving program transformation -- Implementing REDUCE on a microcomputer -- A note on the complexity of constructing Gröbner-bases -- Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations -- The computation of the Hilbert function -- An algorithm for constructing detaching bases in the ring of polynomials over a field -- On the problem of Beh? Edd?n 'Am?l? and the computation of height functions -- A procedure for determining algebraic integers of given norm -- Computation of integral solutions of a special type of systems of quadratic equations -- Factorisation of sparse polynomials -- Early detection of true factors in univariate polynomial factorization -- On the complexity of finding short vectors in integer lattices -- Factoring polynomials over algebraic number fields -- The construction of a "]
[{"$nulls":4},"complete minimal set of contextual normal forms -- A knowledge-based approach to user-friendliness in symbolic computing -- Computer algebra and VLSI, prospects for cross fertilization -- Code optimization of multivariate polynomial schemes: A pragmatic approach."]