Limits of Preprocessing

04/29/2011
by   Stefan Szeider, et al.
0

We present a first theoretical analysis of the power of polynomial-time preprocessing for important combinatorial problems from various areas in AI. We consider problems from Constraint Satisfaction, Global Constraints, Satisfiability, Nonmonotonic and Bayesian Reasoning. We show that, subject to a complexity theoretic assumption, none of the considered problems can be reduced by polynomial-time preprocessing to a problem kernel whose size is polynomial in a structural problem parameter of the input, such as induced width or backdoor size. Our results provide a firm theoretical boundary for the performance of polynomial-time preprocessing algorithms for the considered problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/12/2014

Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning

We present a first theoretical analysis of the power of polynomial-time ...
research
08/24/2023

No Polynomial Kernels for Knapsack

This paper focuses on kernelization algorithms for the fundamental Knaps...
research
10/01/2019

Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions

Kernelization is the fundamental notion for polynomial-time prepocessing...
research
09/17/2020

Algorithms and Complexity for Variants of Covariates Fine Balance

We study here several variants of the covariates fine balance problem wh...
research
10/09/2002

Compilability of Abduction

Abduction is one of the most important forms of reasoning; it has been s...
research
12/03/2018

On the Power of Preprocessing in Decentralized Network Optimization

As communication networks are growing at a fast pace, the need for more ...
research
02/08/2023

Optimal Sufficient Requirements on the Embedded Ising Problem in Polynomial Time

One of the central applications for quantum annealers is to find the sol...

Please sign up or login with your details

Forgot password? Click here to reset