#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2015

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Hendrik Schawe, Roman Bleim, Alexander K. Hartmann
- ArXiv
- 2017

The Boolean Satisfiability problem asks if a Boolean formula is satisfiable by some assignment of the variables or not. It belongs to the NP-complete complexity class and hence no algorithm with polynomial time worst-case complexity is known, i.e., the problem is hard. The K-SAT problem is the subset of the Boolean Satisfiability problem, for which the… (More)

- Hendrik Schawe, Alexander K. Hartmann
- ArXiv
- 2015

The Traveling Salesperson problem asks for the shortest cyclic tour visiting a set of cities given their pairwise distances and belongs to the NP-hard complexity class, which means that with all known algorithms in the worst case instances are not solveable in polynomial time, i.e., the problem is hard. Though that does not mean, that there are not subsets… (More)

- ‹
- 1
- ›