Learning partitions using rank queries
From MaRDI portal
Cites work
- A query algorithm for learning a spanning forest in weighted undirected graphs
- Approximate correlation clustering using same-cluster queries
- Breaking O(nr) for matroid intersection
- Computing exact minimum cuts without knowing the graph
- Correlation clustering with same-cluster queries bounded by optimal cost
- Determination of a Subset from Certain Combinatorial Properties
- Fast algorithms via dynamic-oracle matroids
- Faster matroid intersection
- scientific article; zbMATH DE number 41347 (Why is no real title available?)
- scientific article; zbMATH DE number 1508646 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- scientific article; zbMATH DE number 7788397 (Why is no real title available?)
- Learning a Hidden Matching
- Learning a Hidden Subgraph
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
- Learning spanning forests optimally in weighted undirected graphs with CUT queries
- Learning Theory
- New Query Lower Bounds for Submodular Function Minimization
- On a Combinatorial Problem in Number Theory
- On parity check \((0, 1)\)-matrix over \(\mathbb{Z}_p\)
- Optimal query complexity bounds for finding graphs
- Optimal query complexity for reconstructing hypergraphs
- Optimal reconstruction of graphs under the additive model
- Optimally reconstructing weighted graphs using queries
- Top-k and clustering with noisy comparisons
- Toward a deterministic polynomial time algorithm with optimal additive query complexity
This page was built for publication: Learning partitions using rank queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7263575)
