scientific article; zbMATH DE number 5852793
zbMATH Open1237.06001MaRDI QIDQ3077976FDOQ3077976
Authors:
Publication date: 18 February 2011
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 953683
- Boolean function complexity. Advances and frontiers.
- scientific article; zbMATH DE number 4012691
- scientific article; zbMATH DE number 3880684
- scientific article; zbMATH DE number 3884230
- scientific article; zbMATH DE number 4012495
- Set-theoretical Constructions of Boolean Functions and theirs Applications in Logic Synthesis
- Boolean algebra approximations
- scientific article; zbMATH DE number 4125344
computational complexityinteger programmingdualitynormal formsread-once functionsBoolean functionsBoolean programmingthreshold functionspseudo-Boolean functionsBoolean equationsprime implicantslogic circuitsHorn functionsBoolean expressionsquadratic Boolean functionslogic minimizationpartially defined Boolean functions\texttt{JBool}applications of Boolean functionsBoolean algorithmscharacterizations by functional equationsquadratic Boolean equationsseparating structure
Boolean functions (06E30) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to ordered structures (06-00)
Cited In (only showing first 100 items - show all)
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets
- On anonymous and weighted voting systems
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
- Super-De Morgan functions and free De Morgan quasilattices
- Monotone Boolean functions
- Analysis of Boolean Functions
- Locally monotone Boolean and pseudo-Boolean functions
- Quadratization of symmetric pseudo-Boolean functions
- Minimal and locally minimal games and game forms
- On effectivity functions of game forms
- Two more characterizations of König-Egerváry graphs
- Quadratic reformulations of nonlinear binary optimization problems
- Approximately classic judgement aggregation
- The power of linear programming for general-valued CSPs
- On Boolean threshold functions with minimum specification number
- The give-up problem for blocked regional lists with multi-winners
- Sign-representation of Boolean functions using a small number of monomials
- On a quasi-ordering on Boolean functions
- A functional completeness theorem for De Morgan functions.
- Title not available (Why is that?)
- Extended box clustering for classification problems
- Minimal sets on propositional formulae. Problems and reductions
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
- Computing maximal and minimal trap spaces of Boolean networks
- Generalising and unifying SLUR and unit-refutation completeness
- Title not available (Why is that?)
- Selected problems in the theory of Boolean functions. Ed. by S. F. Vinokurov and N. A. Peryazev.
- On Tackling Explanation Redundancy in Decision Trees
- Hardness results for approximate pure Horn CNF formulae minimization
- On the nonlinearity of monotone Boolean functions
- Prominent classes of the most general subsumptive solutions of Boolean equations
- Equational characterizations of Boolean function classes
- Discrete piecewise linear functions
- An infinite descending chain of Boolean subfunctions consisting of threshold functions
- De Morgan functions and free De Morgan algebras.
- The complexity of general-valued CSPs
- Generalising unit-refutation completeness and SLUR via nested input resolution
- Unsupervised learnable neuron model with nonlinear interaction on dendrites
- Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization
- A new time-independent reliability importance measure
- Totally optimal decision trees for Boolean functions
- Counting inequivalent monotone Boolean functions.
- Invariance groups of finite functions and orbit equivalence of permutation groups.
- Fuzzy relational equations with min-biimplication composition
- On existence of ex post Nash consistent representation for effectivity functions
- Logical analysis of data: classification with justification
- Galois theory for sets of operations closed under permutation, cylindrification, and composition
- Super-Boolean functions and free Boolean quasilattices.
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
- Exact bounds of the Möbius inverse of monotone set functions
- A characterization of nested canalyzing functions with maximum average sensitivity
- Title not available (Why is that?)
- Community structure inspired algorithms for SAT and \#SAT
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
- Title not available (Why is that?)
- On connected Boolean functions
- Competitive evaluation of threshold functions in the priced information model
- On a class of graphs between threshold and total domishold graphs
- A semi-tensor product approach to pseudo-Boolean functions with application to Boolean control networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the orthogonalization of arbitrary Boolean formulae
- On a class of Boolean functions with matroid property
- EAGLE-STARTING AID. Technical informatics. Logical funcions -- Boolean models
- Efficient minimization of higher order submodular functions using monotonic Boolean functions
- The joy of implications, aka pure Horn formulas: mainly a survey
- About some UP-based polynomial fragments of SAT
- Dualization of Boolean functions using ternary decision diagrams
- Lyapunov-based stability and construction of Lyapunov functions for Boolean networks
- On implicational bases of closure systems with unique critical sets.
- Forms of representation for simple games: sizes, conversions and equivalences
- Approximating Boolean functions with depth-2 circuits
- Counting and enumerating aggregate classifiers
- Title not available (Why is that?)
- Variable-depth simulation of most permissive Boolean networks
- On the efficiency of normal form systems for representing Boolean functions
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
- Linear separation of connected dominating sets in graphs
- Risk-budgeting multi-portfolio optimization with portfolio and marginal risk constraints
- Logical analysis of data as a tool for the analysis of probabilistic discrete choice behavior
- On logical bifurcation diagrams
- Boole-De Morgan bilattices
- Hyperidentities and related concepts. II
- MCP: capturing big data by satisfiability (tool description)
- Hyperidentities and related concepts. I
- Autark assignments of Horn CNFs
- Monotone bargaining is Nash-solvable
- The Boolean Determinant Calculus
- Compact quadratizations for pseudo-Boolean functions
- Representation-compatible power indices
- The power of Sherali-Adams relaxations for general-valued CSPs
- Berge-acyclic multilinear 0-1 optimization problems
- Characterization of zigzag De Morgan functions
- Disjointed sum of products by a novel technique of orthogonalizing ORing
- A tractable class of binary VCSPs via M-convex intersection
- \(k\)-maxitive Sugeno integrals as aggregation models for ordinal preferences
- A class of valid inequalities for multilinear 0-1 optimization problems
- Optimal resource allocation enables mathematical exploration of microbial metabolic configurations
- Oblivious bounds on the probability of boolean functions
- Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3077976)