𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The combinatorial complexity of masterkeying

✍ Scribed by Wolfgang Espelage; Egon Wanke

Publisher
Springer
Year
2000
Tongue
English
Weight
241 KB
Volume
52
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Complexity of Some Combinatorial Con
The Complexity of Some Combinatorial Constructions
✍ Hans Georg Carstens πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 530 KB

THE COMPLEXITY OF SOME COMBINATORIAL CONSTRUCTIONS by HASS GEORG C'ARSTENS in Hanriover (G.F.R.

Combinatorial complexity of signed discs
Combinatorial complexity of signed discs
✍ Diane L. Souvaine; Chee-Keng Yap πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 790 KB
Optimizing the topological and combinato
Optimizing the topological and combinatorial complexity of isosurfaces
✍ Carlos AndΓΊjar; Pere Brunet; Antoni Chica; Isabel Navazo; Jarek Rossignac; Γ€lvar πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 506 KB

Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of isosurfaces. Most approaches divide the 3D space into cubes that each occupy the space between eight neighboring samples

Combinatorial Properties and the Complex
Combinatorial Properties and the Complexity of a Max-cut Approximation
✍ Charles Delorme; Svatopluk Poljak πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 667 KB

We study various properties of an eigenvalue upper bound on the max-cut problem. We show that the bound behaves in a manner similar to the max-cut for the operations of switching, vertex splitting, contraction and decomposition. It can also be adjusted for branch and bound techniques. We introduce a