Pages that link to "Item:Q5814795"
From MaRDI portal
The following pages link to The Problem of Simplifying Truth Functions (Q5814795):
Displaying 50 items.
- Projection, consistency, and George Boole (Q265702) (← links)
- A multiple-valued logic approach to the design and verification of hardware circuits (Q266875) (← links)
- Boolean functions with a simple certificate for CNF complexity (Q412324) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- Prominent classes of the most general subsumptive solutions of Boolean equations (Q507645) (← links)
- Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule (Q634260) (← links)
- Projecting systems of linear inequalities with binary variables (Q646699) (← links)
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions (Q646712) (← links)
- A new lower bound on the expected size of irredundant forms for Boolean functions (Q673913) (← links)
- A novel graphical technique for combinational logic representation and optimization (Q680814) (← links)
- A continuous approach to inductive inference (Q687090) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- An excursion in reaction systems: from computer science to biology (Q714816) (← links)
- Optimizing the clausal normal form transformation (Q809622) (← links)
- Exclusive and essential sets of implicates of Boolean functions (Q968115) (← links)
- Recognition of interval Boolean functions (Q1029585) (← links)
- Uncovering deterministic causal structures: a Boolean approach (Q1036076) (← links)
- Minimization of Boolean functions of any number of variables using decimal labels (Q1061718) (← links)
- The automation of syllogistic. I: Syllogistic normal forms (Q1111540) (← links)
- Logic applied to integer programming and integer programming applied to logic (Q1130078) (← links)
- A graph theoretic approach to switching function minimization (Q1168952) (← links)
- Polynomial-time algorithms for generation of prime implicants (Q1190532) (← links)
- Linear resolution for consequence finding (Q1199916) (← links)
- An efficient algorithm for the 3-satisfiability problem (Q1200758) (← links)
- Axiomatization of certain problems of minimization (Q1212444) (← links)
- Boolesche Minimalpolynome und Überdeckungsprobleme (Q1224047) (← links)
- Characteristic measures of switching functions (Q1243267) (← links)
- On the number of prime implicants (Q1251656) (← links)
- Length of prime implicants and number of solutions of random CNF formulae (Q1285568) (← links)
- Resolution and the integrality of satisfiability problems (Q1352293) (← links)
- Generalized resolution for 0--1 linear inequalities (Q1354004) (← links)
- A model of the loop formation process on knitting machines using finite automata theory (Q1367455) (← links)
- A representation of stably compact spaces, and patch topology. (Q1427774) (← links)
- The minimum equivalent DNF problem and shortest implicants (Q1604210) (← links)
- Boolean function minimization in the class of disjunctive normal forms (Q1825217) (← links)
- Hypothesis test for causal explanations in human pathology: Evaluation of pulmonary edema in 181 autopsied patients with leukemia (Q1836258) (← links)
- A syntactical proof of the Marriage Lemma. (Q1853584) (← links)
- Optimal axiomatizations of finitely valued logics (Q1854378) (← links)
- An SE-tree-based prime implicant generation algorithm (Q1924815) (← links)
- General theory for interactions in sufficient cause models with dichotomous exposures (Q1940768) (← links)
- Mixed logical-linear programming (Q1961464) (← links)
- Revealing the canalizing structure of Boolean functions: algorithms and applications (Q2097792) (← links)
- Automatic search for bit-based division property (Q2146095) (← links)
- \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data (Q2207493) (← links)
- Debugging incoherent terminologies (Q2462643) (← links)
- Solution to the realizability problem for irredundant Boolean branch- networks (Q2526681) (← links)
- Combinatorial equivalence of (0,1) circulant matrices (Q2529626) (← links)
- An application of truth functional logic to concept-attainment experiments (Q2540555) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
