@inproceedings{066bcc7d092a495a877d24f555b13c2f,
title = "On One-Sided Testing Affine Subspaces",
abstract = "We study the query complexity of one-sided that describe affine subspaces and Boolean functions that describe axis-parallel affine subspaces, where is any finite field. We give a polynomial-time -testers that ask queries. This improves the query complexity in [11]. We then show that any one-sided -tester with proximity parameter for the class of Boolean functions that describe dimensional affine subspaces and Boolean functions that describe axis-parallel -dimensional affine subspaces must make at least queries, respectively. This improves the lower bound that is proved in [11] for We also give testers for those classes with query complexity that almost match the lower bounds. (See the definitions of the classes in the introduction and many other results in Figs. 1 and 2).",
author = "Bshouty, {Nader H.}",
note = "Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 13th International Symposium on Algorithms and Complexity, CIAC 2023 ; Conference date: 13-06-2023 Through 16-06-2023",
year = "2023",
doi = "10.1007/978-3-031-30448-4_12",
language = "الإنجليزيّة",
isbn = "9783031304477",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "157--171",
editor = "Marios Mavronicolas",
booktitle = "Algorithms and Complexity - 13th International Conference, CIAC 2023, Proceedings",
address = "ألمانيا",
}