The following pages link to (Q3617448):
Displaying 11 items.
- Using relevance queries for identification of read-once functions (Q376140) (← links)
- Some test length bounds for nonrepeating functions in the \(\{ \& , \vee \}\) basis (Q616569) (← links)
- Learning read once functions using subcube parity queries (Q694278) (← links)
- Recognizing the nonrepeating property in an arbitrary basis (Q876600) (← links)
- Testing disjunction as a read-once function in an arbitrary unrepeated basis (Q1037145) (← links)
- Read-once functions with hard-to-test projections (Q1759104) (← links)
- Testing read-once functions over the elementary basis (Q1759130) (← links)
- Iterated Boolean functions in the elementary basis (Q1759196) (← links)
- Testing of read-once functions in extended elementary bases (Q2058707) (← links)
- Testing read-once functions in a median-augmented element basis (Q2130728) (← links)
- (Q5150421) (← links)
