Scholarlink

We study the query complexity of testing monomials (resp., affine and linear subspaces) with one-sided error. Actually, we consider three versions of each of these properties, and obtain the following results regarding the query complexity of testing them with one-sided error. The running time of the testers in the positive results is linear in their query complexity.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

One-Sided Error Testing of Monomials and Affine Subspaces

  • 章节

  • 发表日期：

    2025年

查看全文
  • Oded Goldreich,
  • Dana Ron

摘要

We study the query complexity of testing monomials (resp., affine and linear subspaces) with one-sided error. Actually, we consider three versions of each of these properties, and obtain the following results regarding the query complexity of testing them with one-sided error. The running time of the testers in the positive results is linear in their query complexity.