{"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":12,"n_cols":5,"rows_kept":12,"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],[7,2,7,3],[8,2,8,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910872637903321"]
[null,null,"Titolo",null,"Computational Complexity: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999: Atlanta, Georgia"]
[null,null,"Pubbl/distr/stampa",null,"[Place of publication not identified], : IEEE Computer Society Press, 1999"]
[null,null,"Descrizione fisica",null,"1 online resource"]
[null,null,"Disciplina",null,"511.3"]
[null,null,"Soggetti",null,"Computational complexity"]
[{"$nulls":4},"Computational complexity - Data processing"]
[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,"Sommario/riassunto","Six of the 28 papers chosen for presentation and publication were also chosen for the joint STOC/Complexity session, and so are presented in full in that proceedings and only by abstracts here. Only abstracts and references are provided for the two invited talks as well. Among the topics of the full papers are a lower bound for primality, computing from partial solutions, the complexity of solving equations over finite groups, the expected size of Heilbronn's triangles, quantum branded query complexity, deterministic amplification of space-bounded probabilistic undirected graph connectivity, the shortest lattice vector problem, and complicated complementations. No subject index. Annotation copyrighted by Book News, Inc., Portland, OR."]