A fast algorithm for the Boolean masking problem (Q3759941)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast algorithm for the Boolean masking problem |
scientific article; zbMATH DE number 4009821
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for the Boolean masking problem |
scientific article; zbMATH DE number 4009821 |
Statements
A fast algorithm for the Boolean masking problem (English)
0 references
1985
0 references
Boolean mask combinations
0 references
algorithm
0 references
calculation of Boolean combinations between layers of a VLSI circuit layout
0 references
i-contour problem
0 references
computational geometry
0 references
hidden-line-elimination problem
0 references
computer graphics
0 references
0.7550567984580994
0 references
0.7502309679985046
0 references
0.7455247640609741
0 references
