AI Chat AI Image Generator AI Video Text to Speech

XSAT of Exact Linear CNF Classes

11/20/2017

∙

by Bernd. R. Schuh, et al.

∙

∙

It is shown that l-regularity implies k-uniformity in exact linear CNF formulas. Consequences for exact satisfiability of this formula class are discussed. In particular it is proven that XSAT-satisfiabilty can be decided in sub-exponential time, namely O(exp(sqrt(n))), for l-regular exact linear monotone CNF formulas.

page 1

page 2

page 3

page 4

research

∙ 11/20/2017

XSAT of Linear CNF Formulas

Open questions with respect to the computational complexity of linear CN...

0 Bernd. R. Schuh, et al. ∙

research

∙ 07/31/2018

A simple analysis of flying capacitor converter

The paper aims to emphasise how switched systems can be analysed with el...

0 S. Kadyrov, et al. ∙

research

∙ 08/05/2021

Construction and application of provable positive and exact cubature formulas

Many applications require multi-dimensional numerical integration, often...

0 Jan Glaubitz, et al. ∙

research

∙ 12/01/2017

Closed Formulas of the Arithmetic Mean Component Competitive Ratio for the 3-Objective and 4-Objective Time Series Search Problems

For the multi-objective time series search problem, Hasegawa and Itoh [P...

0 Toshiya Itoh, et al. ∙

research

∙ 03/20/2018

Sub-exponential Upper Bound for #XSAT of some CNF Classes

We derive an upper bound on the number of models for exact satisfiabilit...

0 Bernd Schuh, et al. ∙

research

∙ 01/23/2021

Exactness of quadrature formulas

The standard design principle for quadrature formulas is that they shoul...

0 Lloyd N. Trefethen, et al. ∙

research

∙ 02/16/2022

SAT Backdoors: Depth Beats Size

For several decades, much effort has been put into identifying classes o...

0 Jan Dreier, et al. ∙