Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability
- Submitting institution
-
Birkbeck College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1234
- Type
- E - Conference contribution
- DOI
-
10.1109/FOCS.2015.75des
- Title of conference / published proceedings
- 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
- First page
- 1163
- Volume
- -
- Issue
- -
- ISSN
- 0272-5428
- Open access status
- Out of scope for open access requirements
- Month of publication
- October
- Year of publication
- 2015
- URL
-
https://ieeexplore.ieee.org/document/7354449
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
1 - Algorithms, Verification and Software
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper presents a new combinatorial object called constellations. Subsequently, the concept of constellations has been generalised by Lachish and Gur to a new combinatorial object called daisies which was used to resolve a 15 year old open problem in computer science related coding theory (reported in "On the Power of Relaxed Local Decoding Algorithms", Lachish and Gur, SODA 2020).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -