The following pages link to (Q3077976):
Displaying 50 items.
- Boolean function metrics can assist modelers to check and choose logical rules (Q2670178) (← links)
- Joint realizability of monotone Boolean functions (Q2672606) (← links)
- Lower bounds for Boolean circuits of bounded negation width (Q2672949) (← links)
- A logic for binary classifiers and their explanation (Q2695522) (← links)
- Separable and equatable hypergraphs (Q2696627) (← links)
- Lattice functions and equations (Q2734536) (← links)
- Selected problems in the theory of Boolean functions. Ed. by S. F. Vinokurov and N. A. Peryazev. (Q2748260) (← links)
- Closed classes of Boolean functions. 2nd ed. (Q2755142) (← links)
- Super-Boolean functions and free Boolean quasilattices. (Q2875689) (← links)
- Generalising and Unifying SLUR and Unit-Refutation Completeness (Q2927648) (← links)
- A Semi-Tensor Product Approach to Pseudo-Boolean Functions with Application to Boolean Control Networks (Q2930802) (← links)
- Oblivious bounds on the probability of boolean functions (Q2943565) (← links)
- On linear rewriting systems for Boolean logic and some applications to proof theory (Q2974793) (← links)
- Characterization of zigzag De Morgan functions (Q3178160) (← links)
- Исследование некоторых подклассов мультиаффинных, биюнктивных, слабо положительных и слабо отрицательных булевых функций (Q3381851) (← links)
- Approximating Boolean Functions with Depth-2 Circuits (Q3451753) (← links)
- Community Structure Inspired Algorithms for SAT and #SAT (Q3453228) (← links)
- (Q3813760) (← links)
- (Q4205391) (← links)
- (Q4419472) (← links)
- Algorithms for Boolean Function Query Properties (Q4429679) (← links)
- Boolean Normal Forms, Shellability, and Reliability Computations (Q4490781) (← links)
- (Q4536370) (← links)
- (Q4542178) (← links)
- Lyapunov-Based Stability and Construction of Lyapunov Functions for Boolean Networks (Q4591238) (← links)
- (Q4606689) (← links)
- (Q4612556) (← links)
- (Q4785535) (← links)
- Monotone Boolean functions (Q4829648) (← links)
- Set-theoretical Constructions of Boolean Functions and theirs Applications in Logic Synthesis (Q4932072) (← links)
- A Tractable Class of Binary VCSPs via M-Convex Intersection (Q4972691) (← links)
- Notes on Hazard-Free Circuits (Q4986809) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- Classification of combined action of binary factors and Coxeter groups (Q5031887) (← links)
- On Tackling Explanation Redundancy in Decision Trees (Q5041018) (← links)
- Funciones booleanas, bases de Grobner y cuasigrupos (Q5049642) (← links)
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
- Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search (Q5139600) (← links)
- (Q5140714) (← links)
- (Q5144355) (← links)
- FUNCTIONAL DECOMPOSABILITY CRITERIA FOR QUADRATIC THRESHOLD BOOLEAN FUNCTIONS (Q5150683) (← links)
- Вычисление коэффициента аддитивности для некоторых биюнктивных, слабо положительных и слабо отрицательных булевых функций (Q5152398) (← links)
- Computing Shapley Effects for Sensitivity Analysis (Q5158926) (← links)
- Analysis of Boolean Functions (Q5166888) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- Implementing Efficient All Solutions SAT Solvers (Q5266602) (← links)
- The Complexity of General-Valued CSPs (Q5283238) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- Logic Functions and Equations (Q5503627) (← links)
