On a logical approach to estimating computational complexity of potentially intractable problems.
From MaRDI portal
Recommendations
- Hypergraph transversal computation and related problems in logic and AI
- Achieving new upper bounds for the hypergraph duality problem through logic
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Generating partial and multiple transversals of a hypergraph
- Achieving new upper bounds for the hypergraph duality problem through logic
Cited in
(1)
This page was built for publication: On a logical approach to estimating computational complexity of potentially intractable problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900817)