Pages that link to "Item:Q5932894"
From MaRDI portal
The following pages link to Estimating the complexity of deciphering a threshold functions in a \(k\)-valued logic (Q5932894):
Displaying 7 items.
- On teaching sets of \(k\)-threshold functions (Q342728) (← links)
- On the number of irreducible points in polyhedra (Q343724) (← links)
- Linear read-once and related Boolean functions (Q1801039) (← links)
- On Boolean threshold functions with minimum specification number (Q2105416) (← links)
- A characterization of 2-threshold functions via pairs of prime segments (Q2136278) (← links)
- (Q4729728) (← links)
- On teaching sets for 2-threshold functions of two variables (Q5269159) (← links)