Eintrag weiter verarbeiten
Online-Ressource

Property Testing: Current Research and Surveys

Gespeichert in:

Personen und Körperschaften: Goldreich, Oded (VerfasserIn)
Titel: Property Testing: Current Research and Surveys/ edited by Oded Goldreich
Format: E-Book Konferenzbericht
Sprache: Englisch
veröffentlicht:
Berlin, Heidelberg Springer Berlin Heidelberg 2010
Gesamtaufnahme: SpringerLink
Lecture notes in computer science ; 6390
Schlagwörter:
Computer software
Computational complexity
Information systems
Computer science
Artificial intelligence
Computer graphics
Computer Science
Discrete mathematics.
Computer programming.
Algorithms.
Konferenzschrift > 2010 > Peking
Druckausg.: Property testing, Berlin : Springer, 2010, XI, 358 S.
Quelle: Verbunddaten SWB
LEADER 07372cam a22012012 4500
001 0-165042826X
003 DE-627
005 20240122105243.0
007 cr uuu---uuuuu
008 101112s2010 gw |||||o 00| ||eng c
020 |a 9783642163678  |9 978-3-642-16367-8 
024 7 |a 10.1007/978-3-642-16367-8  |2 doi 
035 |a (DE-627)165042826X 
035 |a (DE-576)333466551 
035 |a (DE-599)BSZ333466551 
035 |a (OCoLC)700521891 
035 |a (OCoLC)846104865 
035 |a (ZBM)1197.68012 
035 |a (DE-He213)978-3-642-16367-8 
035 |a (EBP)040530000 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
044 |c XA-DE 
050 0 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a UM  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
084 |a SS 4800  |2 rvk  |0 (DE-625)rvk/143528: 
084 |a *68-06  |2 msc 
084 |a 68W20  |2 msc 
084 |a 68W25  |2 msc 
084 |a 00B15  |2 msc 
084 |a 54.10  |2 bkl 
100 1 |a Goldreich, Oded  |d 1957-  |0 (DE-588)120549255  |0 (DE-627)520392841  |0 (DE-576)166204544  |4 aut 
245 1 0 |a Property Testing  |b Current Research and Surveys  |c edited by Oded Goldreich 
264 1 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2010 
300 |a Online-Ressource (XI, 359p. 5 illus, online resource) 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
490 1 |a Lecture Notes in Computer Science  |v 6390 
490 0 |a SpringerLink  |a Bücher 
520 |a Editor’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 |a Property 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 |a Computer software 
650 0 |a Computational complexity 
650 0 |a Information systems 
650 0 |a Computer science 
650 0 |a Artificial intelligence 
650 0 |a Computer graphics 
650 0 |a Computer Science 
650 0 |a Discrete mathematics. 
650 0 |a Computer programming. 
650 0 |a Algorithms. 
655 7 |a Konferenzschrift  |y 2010  |z Peking  |0 (DE-588)1071861417  |0 (DE-627)826484824  |0 (DE-576)433375485  |2 gnd-content 
689 0 0 |D s  |0 (DE-588)4196735-5  |0 (DE-627)105201693  |0 (DE-576)210109750  |a Theoretische Informatik  |2 gnd 
689 0 1 |D s  |0 (DE-588)4176929-6  |0 (DE-627)105352527  |0 (DE-576)209974001  |a Randomisierter Algorithmus  |2 gnd 
689 0 2 |D s  |0 (DE-588)4113446-1  |0 (DE-627)105829420  |0 (DE-576)209476559  |a Entscheidungsfindung  |2 gnd 
689 0 3 |D s  |0 (DE-588)4500954-5  |0 (DE-627)24372358X  |0 (DE-576)21308404X  |a Approximationsalgorithmus  |2 gnd 
689 0 4 |D s  |0 (DE-588)4757631-5  |0 (DE-627)374727759  |0 (DE-576)216100801  |a Großes Datenbanksystem  |2 gnd 
689 0 5 |D s  |0 (DE-588)4011133-7  |0 (DE-627)106354221  |0 (DE-576)208891978  |a Datensatz  |2 gnd 
689 0 5 |D s  |0 (DE-588)4367264-4  |0 (DE-627)181761459  |0 (DE-576)211692794  |a Testen  |2 gnd 
689 0 |5 DE-101 
776 1 |z 9783642163661 
776 0 8 |i Druckausg.  |t Property testing  |d Berlin : Springer, 2010  |h XI, 358 S.  |w (DE-627)635192527  |w (DE-576)332278921  |z 3642163661  |z 9783642163661 
830 0 |a Lecture notes in computer science  |v 6390  |9 6390  |w (DE-627)316228877  |w (DE-576)093890923  |w (DE-600)2018930-8  |x 1611-3349  |7 ns 
856 4 0 |u https://doi.org/10.1007/978-3-642-16367-8  |m X:SPRINGER  |x Verlag  |z lizenzpflichtig  |3 Volltext 
856 4 2 |u https://zbmath.org/?q=an:1197.68012  |m B:ZBM  |v 2021-04-12  |x Verlag  |y Zentralblatt MATH  |3 Inhaltstext 
912 |a ZDB-2-LNC 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SEB 
912 |a ZDB-2-LNC  |b 2010 
912 |a ZDB-2-SCS  |b 2010 
912 |a ZDB-2-SXCS  |b 2010 
912 |a ZDB-2-SEB  |b 2010 
936 r v |a SS 4800  |b Lecture notes in computer science  |k Informatik  |k Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen  |k Schriftenreihen (indiv. Sign.)  |k Lecture notes in computer science  |0 (DE-627)1271461242  |0 (DE-625)rvk/143528:  |0 (DE-576)201461242 
936 b k |a 54.10  |j Theoretische Informatik  |q SEPA  |0 (DE-627)106418815 
951 |a BO 
900 |a Goldreich, O. 
950 |a Informatik 
950 |a Theorie 
950 |a Algorithmus 
950 |a Entscheidungsunterstützung 
950 |a Поиск решения 
950 |a Satz 
950 |a Тестирование 
950 |a Approximation 
950 |a Approximation algorithm 
950 |a Very Large Database 
950 |a VLDB 
950 |a Grosses Datenbanksystem 
950 |a Datenbanksystem 
951 |b XB-IL 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-16367-8  |9 DE-14 
852 |a DE-14  |z 2011-07-20T14:58:14Z  |x epn:3336898226 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-16367-8  |9 DE-15 
852 |a DE-15  |z 2014-03-18T11:18:54Z  |x epn:3336898277 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-16367-8  |z Zum Online-Dokument  |9 DE-Zi4 
852 |a DE-Zi4  |z 2014-03-18T11:14:01Z  |x epn:3336898358 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-16367-8  |9 DE-520 
852 |a DE-520  |z 2014-03-18T11:18:54Z  |x epn:3336898447 
980 |a 165042826X  |b 0  |k 165042826X  |o 333466551 
openURL url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Property+Testing%3A+Current+Research+and+Surveys&rft.date=2010&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Property+Testing%3A+Current+Research+and+Surveys&rft.series=Lecture+notes+in+computer+science%2C+6390&rft.au=Goldreich%2C+Oded&rft.pub=Springer+Berlin+Heidelberg&rft.edition=&rft.isbn=364216367X
SOLR
_version_ 1789363316677672960
access_facet Electronic Resources
author Goldreich, Oded
author_facet Goldreich, Oded
author_role aut
author_sort Goldreich, Oded 1957-
author_variant o g og
callnumber-first Q - Science
callnumber-label QA76
callnumber-raw QA76.9.A43
callnumber-search QA76.9.A43
callnumber-sort QA 276.9 A43
callnumber-subject QA - Mathematics
collection ZDB-2-LNC, ZDB-2-SCS, ZDB-2-SEB, ZDB-2-SXCS
contents Editor’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., Property 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.
ctrlnum (DE-627)165042826X, (DE-576)333466551, (DE-599)BSZ333466551, (OCoLC)700521891, (OCoLC)846104865, (ZBM)1197.68012, (DE-He213)978-3-642-16367-8, (EBP)040530000
de15_date 2014-03-18T11:18:54Z
doi_str_mv 10.1007/978-3-642-16367-8
era_facet 2010
facet_912a ZDB-2-LNC, ZDB-2-SCS, ZDB-2-SEB, ZDB-2-SXCS
facet_avail Online
facet_local_del330 Theoretische Informatik, Randomisierter Algorithmus, Entscheidungsfindung, Approximationsalgorithmus, Großes Datenbanksystem, Datensatz, Testen
finc_class_facet Informatik, Mathematik
finc_id_str 0001444471
fincclass_txtF_mv science-computerscience
format eBook, ConferenceProceedings
format_access_txtF_mv Book, E-Book
format_de105 Ebook
format_de14 Book, E-Book
format_de15 Book, E-Book
format_del152 Buch
format_detail_txtF_mv text-online-monograph-independent-conference
format_dezi4 e-Book
format_finc Book, E-Book
format_legacy ElectronicBook
format_legacy_nrw Book, E-Book
format_nrw Book, E-Book
format_strict_txtF_mv E-Book
genre Konferenzschrift 2010 Peking (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content
genre_facet Konferenzschrift
geogr_code not assigned
geogr_code_person Israel
geographic_facet Peking
hierarchy_parent_id 0-316228877
hierarchy_parent_title Lecture notes in computer science
hierarchy_sequence 6390
hierarchy_top_id 0-316228877
hierarchy_top_title Lecture notes in computer science
id 0-165042826X
illustrated Not Illustrated
imprint Berlin, Heidelberg, Springer Berlin Heidelberg, 2010
imprint_str_mv Berlin, Heidelberg: Springer Berlin Heidelberg, 2010
institution DE-14, DE-Zi4, DE-520, DE-15
is_hierarchy_id 0-165042826X
is_hierarchy_title Property Testing: Current Research and Surveys
isbn 9783642163678
isbn_isn_mv 9783642163661, 3642163661
issn_isn_mv 1611-3349
kxp_id_str 165042826X
language English
last_indexed 2024-01-28T19:23:56.791Z
local_heading_facet_dezwi2 Computer software, Computational complexity, Information systems, Computer science, Artificial intelligence, Computer graphics, Computer Science, Discrete mathematics., Computer programming., Algorithms., Theoretische Informatik, Randomisierter Algorithmus, Entscheidungsfindung, Approximationsalgorithmus, Großes Datenbanksystem, Datensatz, Testen
marc024a_ct_mv 10.1007/978-3-642-16367-8
match_str goldreich2010propertytestingcurrentresearchandsurveys
mega_collection Verbunddaten SWB
multipart_link 093890923
multipart_part (093890923)6390
names_id_str_mv (DE-588)120549255, (DE-627)520392841, (DE-576)166204544
oclc_num 700521891, 846104865
physical Online-Ressource (XI, 359p. 5 illus, online resource)
publishDate 2010
publishDateSort 2010
publishPlace Berlin, Heidelberg
publisher Springer Berlin Heidelberg
record_format marcfinc
record_id 333466551
recordtype marcfinc
rsn_id_str_mv (DE-15)2462181
rvk_facet SS 4800
rvk_label Informatik, Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen, Schriftenreihen (indiv. Sign.), Lecture notes in computer science
rvk_path SS, SQ - SU, SS 4000 - SS 5999, SS 4800
rvk_path_str_mv SS, SQ - SU, SS 4000 - SS 5999, SS 4800
series Lecture notes in computer science, 6390
series2 Lecture Notes in Computer Science ; 6390, SpringerLink ; Bücher
source_id 0
spelling Goldreich, Oded 1957- (DE-588)120549255 (DE-627)520392841 (DE-576)166204544 aut, Property Testing Current Research and Surveys edited by Oded Goldreich, Berlin, Heidelberg Springer Berlin Heidelberg 2010, Online-Ressource (XI, 359p. 5 illus, online resource), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, Lecture Notes in Computer Science 6390, SpringerLink Bücher, Editor’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., Property 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., Computer software, Computational complexity, Information systems, Computer science, Artificial intelligence, Computer graphics, Computer Science, Discrete mathematics., Computer programming., Algorithms., Konferenzschrift 2010 Peking (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content, s (DE-588)4196735-5 (DE-627)105201693 (DE-576)210109750 Theoretische Informatik gnd, s (DE-588)4176929-6 (DE-627)105352527 (DE-576)209974001 Randomisierter Algorithmus gnd, s (DE-588)4113446-1 (DE-627)105829420 (DE-576)209476559 Entscheidungsfindung gnd, s (DE-588)4500954-5 (DE-627)24372358X (DE-576)21308404X Approximationsalgorithmus gnd, s (DE-588)4757631-5 (DE-627)374727759 (DE-576)216100801 Großes Datenbanksystem gnd, s (DE-588)4011133-7 (DE-627)106354221 (DE-576)208891978 Datensatz gnd, s (DE-588)4367264-4 (DE-627)181761459 (DE-576)211692794 Testen gnd, DE-101, 9783642163661, Druckausg. Property testing Berlin : Springer, 2010 XI, 358 S. (DE-627)635192527 (DE-576)332278921 3642163661 9783642163661, Lecture notes in computer science 6390 6390 (DE-627)316228877 (DE-576)093890923 (DE-600)2018930-8 1611-3349 ns, https://doi.org/10.1007/978-3-642-16367-8 X:SPRINGER Verlag lizenzpflichtig Volltext, https://zbmath.org/?q=an:1197.68012 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext, http://dx.doi.org/10.1007/978-3-642-16367-8 DE-14, DE-14 2011-07-20T14:58:14Z epn:3336898226, http://dx.doi.org/10.1007/978-3-642-16367-8 DE-15, DE-15 2014-03-18T11:18:54Z epn:3336898277, http://dx.doi.org/10.1007/978-3-642-16367-8 Zum Online-Dokument DE-Zi4, DE-Zi4 2014-03-18T11:14:01Z epn:3336898358, http://dx.doi.org/10.1007/978-3-642-16367-8 DE-520, DE-520 2014-03-18T11:18:54Z epn:3336898447
spellingShingle Goldreich, Oded, Property Testing: Current Research and Surveys, Lecture notes in computer science, 6390, Editor’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., Property 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., Computer software, Computational complexity, Information systems, Computer science, Artificial intelligence, Computer graphics, Computer Science, Discrete mathematics., Computer programming., Algorithms., Konferenzschrift 2010 Peking, Theoretische Informatik, Randomisierter Algorithmus, Entscheidungsfindung, Approximationsalgorithmus, Großes Datenbanksystem, Datensatz, Testen
swb_id_str 333466551
title Property Testing: Current Research and Surveys
title_auth Property Testing Current Research and Surveys
title_full Property Testing Current Research and Surveys edited by Oded Goldreich
title_fullStr Property Testing Current Research and Surveys edited by Oded Goldreich
title_full_unstemmed Property Testing Current Research and Surveys edited by Oded Goldreich
title_in_hierarchy 6390. Property Testing: Current Research and Surveys (2010)
title_short Property Testing
title_sort property testing current research and surveys
title_sub Current Research and Surveys
title_unstemmed Property Testing: Current Research and Surveys
topic Computer software, Computational complexity, Information systems, Computer science, Artificial intelligence, Computer graphics, Computer Science, Discrete mathematics., Computer programming., Algorithms., Konferenzschrift 2010 Peking, Theoretische Informatik, Randomisierter Algorithmus, Entscheidungsfindung, Approximationsalgorithmus, Großes Datenbanksystem, Datensatz, Testen
topic_facet Computer software, Computational complexity, Information systems, Computer science, Artificial intelligence, Computer graphics, Computer Science, Discrete mathematics., Computer programming., Algorithms., Konferenzschrift, Theoretische Informatik, Randomisierter Algorithmus, Entscheidungsfindung, Approximationsalgorithmus, Großes Datenbanksystem, Datensatz, Testen
url https://doi.org/10.1007/978-3-642-16367-8, https://zbmath.org/?q=an:1197.68012, http://dx.doi.org/10.1007/978-3-642-16367-8