000 04420nam a22005655i 4500
001 978-3-642-16367-8
003 DE-He213
005 20160624102150.0
007 cr nn 008mamaa
008 101007s2010 gw | s |||| 0|eng d
020 _a9783642163678
_9978-3-642-16367-8
024 7 _a10.1007/978-3-642-16367-8
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aProperty Testing
_h[electronic resource] :
_bCurrent Research and Surveys /
_cedited by Oded Goldreich.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXI, 359p. 5 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6390
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.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aInformation systems.
650 0 _aArtificial intelligence.
650 0 _aComputer graphics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aComputer Graphics.
650 2 4 _aInformation Systems Applications (incl.Internet).
700 1 _aGoldreich, Oded.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642163661
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6390
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-16367-8
942 _2EBK9366
_cEBK
999 _c38660
_d38660