A Simpler NP-Hardness Proof for Familial Graph Compression

09/07/2020
by   Ammar Ahmed, et al.
0

This document presents a simpler proof showcasing the NP-hardness of Familial Graph Compression.

READ FULL TEXT

page 1

page 2

page 3

research
07/08/2019

Proof compression and NP versus PSPACE: Addendum

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]:...
research
02/03/2022

Even Simpler Deterministic Matrix Sketching

This paper provides a one-line proof of Frequent Directions (FD) for ske...
research
11/02/2018

On the Lazy Set object

The aim of this article is to employ the Lazy Set algorithm as an exampl...
research
02/04/2022

A Framework for Loop and Path Puzzle Satisfiability NP-Hardness Results

Building on the results published in arxiv:2004.12849 we present a gener...
research
04/02/2018

A Note on the Hardness of the Critical Tuple Problem

The notion of critical tuple was introduced by Miklau and Suciu (Gerome ...
research
03/20/2020

Failure of Feasible Disjunction Property for k-DNF Resolution and NP-hardness of Automating It

We show that for every integer k ≥ 2, the Res(k) propositional proof sys...
research
03/04/2014

A proof challenge: multiple alignment and information compression

These notes pose a "proof challenge": a proof, or disproof, of the propo...

Please sign up or login with your details

Forgot password? Click here to reset