Certificates of Non-Membership for Classes of Read-Once Functions
From MaRDI portal
Publication:2934873
DOI10.3233/FI-2014-1032zbMATH Open1318.68099OpenAlexW1496971265MaRDI QIDQ2934873FDOQ2934873
Dmitry Chistikov, V. S. Fedorova, A. A. Voronenko
Publication date: 22 December 2014
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2014-1032
Computational learning theory (68Q32) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Network protocols (68M12)
Cited In (3)
Recommendations
- Read-Once Functions Revisited and the Readability Number of a Boolean Function π π
- The length of a read-many certificate in the basis of all functions of \(l\) variables π π
- Testing read-once functions over the elementary basis π π
- Functions that are read-once on a subset of their inputs π π
- Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Read-once functions with hard-to-test projections π π
- Certification of Nontermination Proofs π π
- Non-malleable functions and their applications π π
This page was built for publication: Certificates of Non-Membership for Classes of Read-Once Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934873)