Publication | Closed Access
A fast computer algorithm for the generation of disjoint cubes for completely and incompletely specified Boolean functions
19
Citations
9
References
2002
Year
Unknown Venue
Mathematical ProgrammingCircuit ComplexityComputational Complexity TheoryEngineeringBoolean FunctionAlgorithmic LibraryComputational ComplexitySpecified Boolean FunctionsComputer-aided DesignHardware SystemsArray ComputingC LanguageDiscrete MathematicsCompilersCombinatorial OptimizationComputational GeometryParallel ComputingFast Computer AlgorithmProgramming LanguagesCube Calculus OperationsComputer EngineeringDisjoint CubesComputer ScienceLogic SynthesisFormal MethodsParallel ProgrammingDiscrete Structure
An algorithm is presented that generates an array of disjoint cubes describing completely and incompletely specified Boolean functions. A peculiar feature of the algorithm, which speeds up its execution, is that in comparison to known algorithms it minimizes the number of usages of cube calculus operations. Pointer structures and array allocations of the C language are effectively used in its implementation.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
| Year | Citations | |
|---|---|---|
Page 1
Page 1