Reference : On the complexity of representing sets of vertices in the n-cube
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Physical, chemical, mathematical & earth Sciences : Mathematics
http://hdl.handle.net/10993/3289
On the complexity of representing sets of vertices in the n-cube
English
Couceiro, Miguel mailto [University of Tampere, Finland]
Foldes, Stephan mailto [Tampere University of Technology, Finland]
Lehtonen, Erkko mailto [Tampere University of Technology, Finland]
2005
ICNAAM 2005
Tsitouras, C.
Simos, T. E.
Psihoyios, G.
Wiley-VCH
876-877
Yes
No
International
9783527406524
Weinheim
Germany
International Conference of Numerical Analysis and Applied Mathematics 2005 (ICNAAM 2005)
16-20 September 2005
Rhodes
Greece
[en] sets of hypercube vertices ; representation complexity
[en] Representations of an arbitrary set of vertices of an n-dimensional cube in terms of convex sets are compared with respect to their complexity. The notion of complexity used in the representations is based on the union, symmetric difference and ternary median operations. Convexity of a set of vertices refers to Hamming distance or, equivalently, to the intersection of cubes with supporting hyperplanes.
http://hdl.handle.net/10993/3289
ICNAAM

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
ICNAAM2005.pdfAuthor preprint201.42 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.