Pages that link to "Item:Q5905060"
From MaRDI portal
The following pages link to Threshold Numbers and Threshold Completions (Q5905060):
Displaying 22 items.
- Bipartite bithreshold graphs (Q688258) (← links)
- Cones of closed alternating walks and trails (Q880043) (← links)
- Complete simple games (Q1278570) (← links)
- Some complexity results about threshold graphs (Q1327235) (← links)
- Total matchings and total coverings of threshold graphs (Q1327237) (← links)
- On the characterization of weighted simple games (Q1698978) (← links)
- Sphere coverings of the hypercube with incomparable centers (Q1813996) (← links)
- On data classification by iterative linear partitioning (Q1885803) (← links)
- Simple games and magic squares (Q1894010) (← links)
- On the geometric separability of Boolean functions (Q1917289) (← links)
- On the enumeration of bipartite simple games (Q2022519) (← links)
- Computational aspects of relaxation complexity (Q2061898) (← links)
- Complexity of linear relaxations in integer programming (Q2149550) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- Winning coalitions in plurality voting democracies (Q2235088) (← links)
- Computational aspects of relaxation complexity: possibilities and limitations (Q2689831) (← links)
- Bounds on Threshold Dimension and Disjoint Threshold Coverings (Q3029042) (← links)
- Threshold Dimension of Graphs (Q3204506) (← links)
- Representations of Boolean functions by systems of linear inequalities (Q3744091) (← links)
- Estimating the efficiency of threshold representations of Boolean functions (Q4005316) (← links)
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial (Q5499731) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)
