Pages that link to "Item:Q1190532"
From MaRDI portal
The following pages link to Polynomial-time algorithms for generation of prime implicants (Q1190532):
Displaying 14 items.
- Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule (Q634260) (← links)
- Efficient query processing with reduced implicate tries (Q877893) (← links)
- An efficient algorithm to generate prime implicants (Q1283201) (← links)
- The minimum equivalent DNF problem and shortest implicants (Q1604210) (← links)
- Algorithms for selective enumeration of prime implicants (Q1606302) (← links)
- An SE-tree-based prime implicant generation algorithm (Q1924815) (← links)
- Computing prime implicates by pruning the search space and accelerating subsumption (Q3133151) (← links)
- (Q3698700) (← links)
- (Q4140891) (← links)
- Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes (Q4362281) (← links)
- Prime implicants of first order formulas via transversal clauses (Q4464262) (← links)
- (Q4870090) (← links)
- (Q5018517) (← links)
- The Decomposition Tree for analyses of Boolean functions (Q5458074) (← links)