Database Paper Browser

Back to papers

Deciding Monotone Duality and Identifying Frequent Itemsets in Quadratic Logspace

Summary: Shows monotone duality/hypergraph transversal testing is in DSPACE[log^2 n] via Boros–Makino problem decomposition, giving a quadratic‑logspace algorithm. Consequence: given maximal frequent and minimal infrequent itemsets, existence of any other (in)frequent itemset decidable in quadratic logspace. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1596
Venue
PODS
Year
2013
Pagerank
6.0227856e-05
Overall Rank
4,653 | 67.64%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
1,650 Efficient Enumeration of Maximal k-Plexes 2015 SIGMOD 0.00011013428
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers