The following pages link to Michał Karpiński (Q730004):
Displaying 5 items.
- Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete (Q730005) (← links)
- On vertex coloring without monochromatic triangles (Q1625170) (← links)
- Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency (Q1685966) (← links)
- Encoding cardinality constraints using multiway merge selection networks (Q2009191) (← links)
- Incremental encoding of pseudo-Boolean goal functions based on comparator networks (Q2661378) (← links)
