Pages that link to "Item:Q542310"
From MaRDI portal
The following pages link to On the complexity of discrete generation problems (Q542310):
Displaying 11 items.
- A nonapproximability result for finite function generation (Q287157) (← links)
- Construction of irredundant coverings of a Boolean matrix (Q492423) (← links)
- Complexity of generation (Q1625133) (← links)
- Asymptotically optimal dualization algorithms (Q2354515) (← links)
- On \(O(1)\) time algorithms for combinatorial generation (Q2765228) (← links)
- On the complexity of the dualization problem (Q2838941) (← links)
- Asymptotic estimates for the number of solutions of the dualization problem and its generalizations (Q2898206) (← links)
- (Q3570242) (← links)
- (Q3761543) (← links)
- On the complexity of narrow systems of Boolean vectors (Q4522831) (← links)
- Small Generating Sets and DLPC Problem (Q4976409) (← links)