000 03928nam a22003735i 4500
001 303443
003 MX-SnUAN
005 20160429155822.0
007 cr nn 008mamaa
008 150903s2011 gw | o |||| 0|eng d
020 _a9783642163678
_99783642163678
024 7 _a10.1007/9783642163678
_2doi
035 _avtls000355991
039 9 _a201509030944
_bVLOAD
_c201405060358
_dVLOAD
_y201402191207
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.A43
100 1 _aGoldreich, Oded.
_eeditor.
_9330950
245 1 0 _aProperty Testing :
_bCurrent Research and Surveys /
_cedited by Oded Goldreich.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2011.
300 _axI, 359 páginas 5 ilustraciones
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6390
500 _aSpringer eBooks
505 0 _aEditor’s Introduction -- A Brief Introduction to Property Testing -- The Program of the Mini-Workshop -- Surveys -- Limitation on the Rate of Families of Locally Testable Codes -- Testing Juntas -- Sublinear-time Algorithms --  Short Locally Testable Codes and Proofs: A Survey in Two Parts -- Introduction to Testing Graph Properties -- Property Testing of Massively Parameterized Problems -- Sublinear Graph Approximation Algorithms -- Transitive-Closure Spanners -- Testing by Implicit Learning -- Invariance in Property Testing -- Extended Abstracts -- Testing Monotone Continuous Distributions on High-Dimensional Real Cubes -- On Constant Time Approximation of Parameters of Bounded Degree Graphs -- Sublinear Algorithms in the External Memory Model -- Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity -- Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability -- Testing Linear-Invariant Non-linear Properties: A Short Report --  Optimal Testing of Reed-Muller Codes -- Query-Efficient Dictatorship Testing with Perfect Completeness -- Composition of Low-Error 2-Query PCPs Using Decodable PCPs -- Hierarchy Theorems for Property Testing -- Algorithmic Aspects of Property Testing in the Dense Graphs Model -- Testing Euclidean Spanners -- Symmetric LDPCCodes and Local Testing -- Some Recent Results on Local Testing of Sparse Linear Codes -- Testing (Subclasses of) Halfspaces -- Dynamic Approximate Vertex Cover and Maximum Matching -- Local Property Reconstruction and Monotonicity -- Green’s Conjecture and Testing Linear Invariant Properties.
520 _aProperty Testing is the study of super-fast (randomized) algorithms for approximate decision making. These algorithms are given direct access to items of a huge data set, and determine, whether this data set has some predetermined (global) property or is far from having this property. Remarkably, this approximate decision is made by accessing a small portion of the data set. This state-of-the-art survey presents a collection of extended abstracts and surveys of leading researchers in property testing and related areas; it reflects the program of a mini-workshop on property testing that took place in January 2010 at the Institute for Computer Science (ITCS), Tsinghua University, Beijing, China. The volume contains two editor's introductions, 10 survey papers and 18 extended abstracts.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783642163661
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-16367-8
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c303443
_d303443