Pages that link to "Item:Q1028148"
From MaRDI portal
The following pages link to Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT (Q1028148):
Displayed 4 items.
- \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments (Q329039) (← links)
- Popular matchings with variable item copies (Q631788) (← links)
- On the complexity of multi-parameterized cluster editing (Q2407948) (← links)
- Clustering without replication in combinatorial circuits (Q2424822) (← links)