Approximately counting and sampling small witnesses using a colourful decision oracle

DOI10.1137/1.9781611975994.135OpenAlexW2960856150MaRDI QIDQ5146924

Holger Dell, John Lapinskas, Kitty Meeks

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.04826

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (5)

On triangle estimation using tripartite independent set queries ⋮ Fast exact algorithms using Hadamard product of polynomials ⋮ Counting Small Induced Subgraphs with Hereditary Properties ⋮ Parameterized Counting and Cayley Graph Expanders ⋮ Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems

This page was built for publication: Approximately counting and sampling small witnesses using a colourful decision oracle