The following pages link to (Q3997892):
Displayed 30 items.
- Symmetric approximations of pseudo-Boolean functions with applications to influence indexes (Q449336) (← links)
- Signed graphs with negative self evaluation and clusterability of graphs (Q702554) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- Self-consistency of decision rules for group decision making (Q872149) (← links)
- The class of microarray games and the relevance index for genes (Q926582) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
- Fundamentals of simple games from a viewpoint of blockability relations (Q1021485) (← links)
- Transversality of the Shapley value (Q1024691) (← links)
- Positive and Horn decomposability of partially defined Boolean functions (Q1356507) (← links)
- Error-free and best-fit extensions of partially defined Boolean functions (Q1383161) (← links)
- Interior and exterior functions of positive Boolean functions. (Q1408452) (← links)
- Convexity and logical analysis of data (Q1575707) (← links)
- Voting fairly: Transitive maximal intersecting families of sets (Q1584664) (← links)
- Logical analysis of binary data with missing bits (Q1606295) (← links)
- On the inference of semi-coherent structures from data (Q1781558) (← links)
- Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396) (← links)
- Quasi-clusterability of signed graphs with negative self evaluation (Q1888283) (← links)
- Simple games and magic squares (Q1894010) (← links)
- Decomposability of partially defined Boolean functions (Q1900137) (← links)
- Minimum self-dual decompositions of positive dual-minor Boolean functions (Q1961458) (← links)
- Inner-core and outer-core functions of partially defined Boolean functions (Q1961465) (← links)
- A method to compare influence of coalitions on group decision other than desirability relation (Q2371497) (← links)
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)
- The complexity of modular decomposition of Boolean functions (Q2387426) (← links)
- Bounds for \(| W^ m\cup B^ m| \) for simple games. (Q2468633) (← links)
- Dimension of complete simple games with minimum (Q2470114) (← links)
- Generating dual-bounded hypergraphs (Q4405941) (← links)
- A note about games-composition dimension (Q5951969) (← links)