Sign inSign in

David Witmer

David Witmer is a Professor at Carnegie Mellon University working on complexity theory and algorithms in graph theory, constraint satisfaction and optimization.

More

David Witmer is a Professor at Carnegie Mellon University working on complexity theory and algorithms in graph theory, constraint satisfaction and optimization. His CMU 15-455 session on NP-completeness builds from the Cook-Levin theorem to reductions from 3SAT to E3SAT, NAE-4SAT and NAE-3SAT.

About

David Witmer is a Professor at Carnegie Mellon University working on complexity theory and algorithms in graph theory, constraint satisfaction and optimization. His CMU 15-455 session on NP-completeness builds from the Cook-Levin theorem to reductions from 3SAT to E3SAT, NAE-4SAT and NAE-3SAT.

Connections

4

Their places, courses, books and lectures.