GSF-locality is not sufficient for proximity-oblivious testing

Adler, I., Köhler, N. and Peng, P. orcid.org/0000-0003-2700-5699 (2021) GSF-locality is not sufficient for proximity-oblivious testing. In: Kabanets, V., (ed.) 36th Computational Complexity Conference (CCC 2021). Computational Complexity Conference (CCC), 20-22 Jul 2021, Virtual conference (Toronto, Ontario, Cananda). Leibniz International Proceedings in Informatics (LIPIcs), 200 . Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 34:1-34:27. ISBN 9783959771931

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © Isolde Adler, Noleen Köhler, and Pan Peng; licensed under Creative Commons License CC-BY 4.0. https://creativecommons.org/licenses/by/4.0/legalcode
Keywords: Property testing; proximity-oblivous testing; locality; first-order logic; lower bound
Dates:
  • Accepted: 28 April 2021
  • Published (online): 8 July 2021
  • Published: 8 July 2021
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 09 Jun 2021 07:29
Last Modified: 28 Sep 2021 15:51
Status: Published
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Series Name: Leibniz International Proceedings in Informatics (LIPIcs)
Refereed: Yes
Identification Number: https://doi.org/10.4230/LIPIcs.CCC.2021.34
Related URLs:

Share / Export

Statistics