arXiv (All)
open access
An ETH-based quasipolynomial lower bound for Dualization
Dualizing monotone Boolean functions (or equivalently, enumerating minimal transversals in hypergraphs) is a long-standing problem whose output-polynomial-time solvability remains open. While various special cases have been extensively studied, the state-of-the-art algorithm for the general case, du
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Learning for Graph Matching and Related Combinatorial Optimization Problems#478214
- Disjunctive Submodular Functions: Envelopes and Applications to Inventory and 0-1 Quadratic Optimization#1105271
- Tractability of Hard Digraph Cut Problems on Eulerian Instances: Treewidth Reduction and Reducing CMSO to Unbreakable Eulerian Instances#1341751
- Primal-dual splitting algorithms for constrained monotone inclusions#1347808
- A Uniform Algorithm for Strict NP on Bounded-Treedepth Graphs#1215659
Record · ID 1248753
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive