The following pages link to (Q3077976):
Displaying 28 items.
- Approximating Minimum Representations of Key Horn Functions (Q5863327) (← links)
- (Q5863855) (← links)
- Editorial: Special issue on Boolean functions and their applications (Q5890596) (← links)
- Book review of: S. Jukna, Boolean function complexity. Advances and frontiers. (Q5890688) (← links)
- A lower bound on CNF encodings of the at-most-one constraint (Q5915765) (← links)
- A first polynomial non-clausal class in many-valued logic (Q6083144) (← links)
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles (Q6094712) (← links)
- Partially unate Boolean functions: properties of their sum-of-products representations (Q6110617) (← links)
- Classifying 1D elementary cellular automata with the 0-1 test for chaos (Q6111904) (← links)
- On the (complete) reasons behind decisions (Q6117140) (← links)
- Adaptive Importance Sampling Based on Fault Tree Analysis for Piecewise Deterministic Markov Process (Q6131422) (← links)
- Union-closed sets and Horn Boolean functions (Q6144385) (← links)
- Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms (Q6150959) (← links)
- Boolean dynamics revisited through feedback interconnections (Q6151156) (← links)
- Incomplete cooperative games with player-centered information (Q6153468) (← links)
- Matroid Horn functions (Q6187338) (← links)
- Hypergraph Horn functions (Q6499011) (← links)
- ZDD Boolean synthesis (Q6535560) (← links)
- A new class of explanations for classifiers with non-binary features (Q6545524) (← links)
- Propagation criterion for monotone Boolean functions with least vector support set of 1 or 2 elements (Q6548988) (← links)
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences (Q6561231) (← links)
- Boolean proportions (Q6563049) (← links)
- On the failings of Shapley values for explainability (Q6577659) (← links)
- Learning decision catalogues for situated decision making: the case of scoring systems (Q6577678) (← links)
- Lattice structures that parameterize regulatory network dynamics (Q6594600) (← links)
- An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages (Q6630721) (← links)
- Computational complexity of minimal trap spaces in Boolean networks (Q6633132) (← links)
- Notes on Boolean read-\(k\) and multilinear circuits (Q6648273) (← links)
