Checking Tests for Read-Once Functions over Arbitrary Bases

DOI10.1007/978-3-642-30642-6_6zbMath1360.06006arXiv1203.0631OpenAlexW2962843752MaRDI QIDQ2907486

Dmitry Chistikov

Publication date: 10 September 2012

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.0631

Mathematics Subject Classification ID

Computational learning theory (68Q32) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Boolean functions (06E30)

Related Items (2)

Using relevance queries for identification of read-once functions ⋮ The length of a read-many certificate in the basis of all functions of \(l\) variables

This page was built for publication: Checking Tests for Read-Once Functions over Arbitrary Bases