Pages that link to "Item:Q1594168"
From MaRDI portal
The following pages link to On the complexity of deciphering the threshold functions of \(k\)-valued logic (Q1594168):
Displaying 5 items.
- On teaching sets of \(k\)-threshold functions (Q342728) (← links)
- On the number of irreducible points in polyhedra (Q343724) (← links)
- A characterization of 2-threshold functions via pairs of prime segments (Q2136278) (← links)
- Graphical Enumeration and Stained Glass Windows, 1: Rectangular Grids (Q3390423) (← links)
- On teaching sets for 2-threshold functions of two variables (Q5269159) (← links)
