The following pages link to NP-completeness: A retrospective (Q4571936):
Displaying 24 items.
- Generating all maximal models of a Boolean expression (Q294760) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- NP-completeness of the energy barrier problem without pseudoknots and temporary arcs (Q537858) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
- Algorithms for compact letter displays: comparison and evaluation (Q1020871) (← links)
- Lower bounds for three algorithms for transversal hypergraph generation (Q1028117) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\). (Q1853168) (← links)
- A brief history of NP-completeness, 1954--2012 (Q1946035) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- On the fixed-parameter tractability of the equivalence test of monotone normal forms (Q2379965) (← links)
- Computational aspects of mining maximal frequent patterns (Q2508965) (← links)
- Separation of NP-completeness notions (Q2784487) (← links)
- Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
- How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms (Q3007677) (← links)
- Beyond NP (Q3581420) (← links)
- (Q3613100) (← links)
- (Q4234077) (← links)
- On Unapproximable Versions of $NP$-Complete Problems (Q5691296) (← links)
