scientific article
From MaRDI portal
Publication:2768039
zbMath0989.68059MaRDI QIDQ2768039
Publication date: 14 July 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Counting vertices of integral polytopes defined by facets ⋮ A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry ⋮ Sampling and Statistical Physics via Symmetry
This page was built for publication:
