NDLI: Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability

Content Provider	IEEE Xplore Digital Library
Author	Fischer, E. Lachish, O. Vasudev, Y.
Copyright Year	2015
Description	Author affiliation: Birkbeck, Univ. of London, London, UK (Lachish, O.) \|\| Fac. of Comput. Sci., Israel Inst. of Technol., Haifa, Israel (Fischer, E.; Vasudev, Y.)
Abstract	We show that every non-adaptive property testing algorithm making a constant number of queries, over a fixed alphabet, can be converted to a sample-based (as per [Gold Reich and Ron, 2015]) testing algorithm whose average number of queries is a fixed, smaller than 1, power of n. Since the query distribution of the sample-based algorithm is not dependent at all on the property, or the original algorithm, this has many implications in scenarios where there are many properties that need to be tested for concurrently, such as testing (relatively large) unions of properties, or converting a Merlin-Arthur Proximity proof (as per [Gur and Rothblum, 2013]) to a proper testing algorithm. The proof method involves preparing the original testing algorithm for a combinatorial analysis. For the analysis we develop a structural lemma for hyper graphs that may be of independent interest. When analyzing a hyper graph that was extracted from a 2-sided test, it allows for finding generalized sunflowers that provide for a large-deviation type analysis. For 1-sided tests the bounds can be improved further by applying Janson's inequality directly over our structures.
Starting Page	1163
Ending Page	1182
File Size	347481
Page Count	20
File Format	PDF
ISBN	9781467381918
ISSN	02725428
DOI	10.1109/FOCS.2015.75
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-10-17
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Testing Computer science Complexity theory Scalability Algorithm design and analysis Indexes Polynomials hypergraphs property testing sampling
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Trading query complexity for sample-based testing and multi-testing scalability

Dispersion of Mass and the Complexity of Randomized Geometric Algorithms

Pseudorandom Bits for Polynomials

A sampling-based algorithm for multi-robot visibility-based pursuit-evasion

Simultaneous escape routing and layer assignment for dense PCBs

Almost Optimal Canonical Property Testers for Satisfiability

An Improved XML Index Structural Connection Algorithm Based on Orthogonal B+ tree

Computational complexity of roots of real functions

Some connections between bounded query classes and nonuniform complexity

Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability

Similar Documents

Trading query complexity for sample-based testing and multi-testing scalability

Dispersion of Mass and the Complexity of Randomized Geometric Algorithms

Pseudorandom Bits for Polynomials

A sampling-based algorithm for multi-robot visibility-based pursuit-evasion

Simultaneous escape routing and layer assignment for dense PCBs

Almost Optimal Canonical Property Testers for Satisfiability

An Improved XML Index Structural Connection Algorithm Based on Orthogonal B+ tree

Computational complexity of roots of real functions

Some connections between bounded query classes and nonuniform complexity

Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability