Probabilistic combinatorial optimization
- 1 January 1981
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Complexity of Partial SatisfactionJournal of the ACM, 1981
- The complexity of satisfiability problemsPublished by Association for Computing Machinery (ACM) ,1978
- On coloring graphs to maximize the proportion of multicolored k-edgesJournal of Combinatorial Theory, 1968