{"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":37,"n_cols":5,"rows_kept":37,"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],[7,2,7,3],[8,2,8,3],[10,2,10,3],[10,4,10,5],[11,2,11,3],[11,4,11,5],[12,2,12,3],[12,4,12,5],[13,2,13,3],[14,2,14,3],[15,2,15,3],[16,2,16,3],[34,2,34,3],[35,2,35,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNICAMPANIAVAN0274508"]
[null,null,"Autore",null,"Andrei, Neculai"]
[null,null,"Titolo",null,"A Derivative-free Two Level Random Search Method for Unconstrained Optimization / Neculai Andrei"]
[null,null,"Pubbl/distr/stampa",null,"Cham, : Springer, 2021"]
[null,null,"Descrizione fisica",null,"xi, 118 p. : ill. ; 24 cm"]
[null,null,"Soggetti",null,"90-XX - Operations research, mathematical programming [MSC 2020]"]
[{"$nulls":4},"90C59 - Approximation methods and heuristics in mathematical programming [MSC 2020]"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNICAMPANIAVAN00113703"]
[null,null,"Autore",null,"Slinko, Arkadii"]
[null,null,"Titolo",null,"Algebra for applications : cryptography, secret sharing, error-correcting, fingerprinting, compression / Arkadii Slinko"]
[null,null,"Pubbl/distr/stampa",null,"[Cham], : Springer, 2015"]
[null,null,"Titolo uniforme",null,"Algebra for applications : cryptography, secret sharing, error-correcting, fingerprinting, compression"]
[null,null,"Descrizione fisica",null,"XIV, 328 p. : ill. ; 24 cm"]
[null,null,"Soggetti",null,"11A05 - Multiplicative structure; Euclidean algorithm; greatest common divisors [MSC 2020]"]
[{"$nulls":4},"11A51 - Factorization; primality [MSC 2020]"]
[{"$nulls":4},"11C08 - Polynomials in number theory [MSC 2020]"]
[{"$nulls":4},"11C20 - Matrices, determinants in number theory [MSC 2020]"]
[{"$nulls":4},"11T06 - Polynomials over finite fields [MSC 2020]"]
[{"$nulls":4},"11T71 Algebraic coding theory; cryptography [MSC 2020]"]
[{"$nulls":4},"11Y05 - Factorization [MSC 2020]"]
[{"$nulls":4},"11Y11 - Primality [MSC 2020]"]
[{"$nulls":4},"11Y16 - Number-theoretic algorithms; complexity [MSC 2020]"]
[{"$nulls":4},"12E20 - Finite fields (field-theoretic aspects) [MSC 2020]"]
[{"$nulls":4},"14G50 - Applications to coding theory and cryptography of algebraic geometry [MSC 2020]"]
[{"$nulls":4},"14H52 - Elliptic curves [MSC 2020]"]
[{"$nulls":4},"20A05 - Axiomatics and elementary properties of groups [MSC 2020]"]
[{"$nulls":4},"20B30 - Symmetric groups [MSC 2020]"]
[{"$nulls":4},"68P25 - Data encryption [MSC 2020]"]
[{"$nulls":4},"68P30 - Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) [MSC 2020]"]
[{"$nulls":4},"94A60 - Cryptography [MSC 2020]"]
[{"$nulls":4},"94A62 - Authentication, digital signatures and secret sharing [MSC 2020]"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]