The Wobbly Logic Engine : Proving Hardness

Abstract

In this paper we describe a general technique for establishing NP-hardness of graph representations. This technique is a generalization of the tool called the logic engine. We show that it is possible to extend it to a wobbly logic engine, which provides a proof method of NP-hardness for a variety of graph representations for which the set of feasible… (More)

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics