Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data-Reference-Cited by-同舟云学术

Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data

Published:2007-06 Issue:3 Volume:379 Page:361-376
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Khachiyan Leonid,Boros Endre,Elbassioni Khaled,Gurvich Vladimir,Makino Kazuhisa

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference19 articles.

1. Fast discovery of association rules;Agrawal,1996

2. A note on finding a maximum empty rectangle;Atallah;Discrete Applied Mathematics,1986

3. L. Budach, B. Graw, C. Meinel, S. Waack, Algebraic and topological properties of finite partially ordered sets, in: Teubner-texte zur Mathematik, Band 109, 1988

4. Complexity of identification and dualization of positive Boolean functions;Bioch;Information and Computation,1995

5. Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities;Boros;SIAM Journal on Computing,2002

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Left-to-Right Multiplication for Monotone Boolean Dualization;SIAM Journal on Computing;2010-01

2. Lower bounds for three algorithms for transversal hypergraph generation;Discrete Applied Mathematics;2009-04

3. Algorithms for Dualization over Products of Partially Ordered Sets;SIAM Journal on Discrete Mathematics;2009-01

4. A Fast and Simple Parallel Algorithm for the Monotone Duality Problem;Automata, Languages and Programming;2009

5. Scientific contributions of Leo Khachiyan (a short overview);Discrete Applied Mathematics;2008-06