Using relevance queries for identification of read-once functions

DOI10.1007/S10958-013-1401-YzbMATH Open1276.68087OpenAlexW2047225319MaRDI QIDQ376140FDOQ376140

Authors: Dmitry Chistikov 

Publication date: 4 November 2013

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-013-1401-y

Recommendations

• Read-Once Functions Revisited and the Readability Number of a Boolean Function
• Functions that are read-once on a subset of their inputs
• Interactive function identification decreasing the effort of reverse engineering
• Read-once functions with hard-to-test projections
• Testing read-once functions over the elementary basis

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

• Learning regular sets from queries and counterexamples
• Checking tests for read-once functions over arbitrary bases
• Learning read-once formulas with queries
• A theory of the learnable
• Title not available (Why is that?)
• Title not available (Why is that?)
• On almost bad Boolean bases
• Title not available (Why is that?)
• The number of Boolean functions computed by formulas of a given size
• Combinatorial characterization of read-once formulae
• Learning read once functions using subcube parity queries

Cited In (4)

• Learning Boolean read-once formulas over generalized bases
• Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
• Learning read-once formulas with queries
• Learning read once functions using subcube parity queries

This page was built for publication: Using relevance queries for identification of read-once functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q376140)