scientific article; zbMATH DE number 2086380
From MaRDI portal
Publication:4736834
zbMath1054.68072MaRDI QIDQ4736834
Endre Boros, Kazuhisa Makino, Vladimir A. Gurvich, Leonid G. Khachiyan
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2285/22850133.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (17)
Dual-bounded generating problems: Weighted transversals of a hypergraph ⋮ On the complexity of inducing categorical and quantitative association rules ⋮ An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation ⋮ The Minimal Hitting Set Generation Problem: Algorithms and Computation ⋮ An inequality for polymatroid functions and its applications. ⋮ A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs ⋮ Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic ⋮ The complexity of satisfying constraints on databases of transactions ⋮ Some decision and counting problems of the Duquenne-Guigues basis of implications ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Self-duality of bounded monotone Boolean functions and related problems ⋮ Discovery of the \(D\)-basis in binary tables based on hypergraph dualization ⋮ A framework for incremental generation of closed itemsets ⋮ Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry ⋮ Generating dual-bounded hypergraphs ⋮ Computational aspects of mining maximal frequent patterns ⋮ An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
This page was built for publication:
