Recognizing Intersection Patterns

DOI10.1016/S0167-5060(08)70883-5MaRDI QIDQ3892263zbMATH OpenFDO

Authors

Publication date 1980

Published in Combinatorics 79 Part I (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-5060(08)70883-5

zbMATH Keywords

Hamming distanceintersection patternsNP- completenesszero-one matrices

Mathematics Subject Classification ID

Other designs, configurations (05B30) Other finite incidence structures (geometric aspects) (51E30) Analysis of algorithms and problem complexity (68Q25)

Cited in

(6)

• Sums of cuts and bipartite metrics
• Hypercube embedding of generalized bipartite metrics
• Channel metrization
• Minimum dimensional Hamming embeddings
• The complexity of satisfying constraints on databases of transactions
• Isometric Hamming embeddings of weighted graphs

This page was built for publication: Recognizing Intersection Patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3892263)