Instance complexity of Boolean functions

DOI10.46298/DMTCS.15917MaRDI QIDQ7364495zbMATH OpenFDO

Authors Hsiang-Hsuan Liu, Nikhil S. Mande

Publication date 2 October 2026

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/DMTCS.15917

Mathematics Subject Classification ID

Combinatorics (05-XX)

Cites work

• Competitive information design for Pandora's Box
• Complete subgraphs are elusive
• Complexity measures and decision tree complexity: a survey.
• Computing minimum spanning trees with uncertainty
• Computing shortest paths with uncertainty
• Computing the median with uncertainty
• scientific article; zbMATH DE number 2123255 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• scientific article; zbMATH DE number 7650404 (Why is no real title available?)
• Query-competitive algorithms for cheapest set problems under uncertainty
• Query-competitive sorting with uncertainty
• Turan's Graph Theorem

This page was built for publication: Instance complexity of Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364495)