The following pages link to Some Notes on Pseudo-closed Sets (Q3590984):
Displaying 7 items.
- Some remarks on multiplicatively closed sets (Q384556) (← links)
- Succinctness and tractability of closure operator representations (Q507522) (← links)
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- A note on P-selective sets and closeness (Q673619) (← links)
- Note on \(IR\)-closed and \(A_{IR}\)-sets (Q1046858) (← links)
- Fast algorithms for implication bases and attribute exploration using proper premises (Q2248531) (← links)
- ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS (Q5151065) (← links)
