Worst-Case Upper Bound for (1, 2)-QSAT

02/24/2011
by   Minghao Yin, et al.
0

The rigorous theoretical analysis of the algorithm for a subclass of QSAT, i.e. (1, 2)-QSAT, has been proposed in the literature. (1, 2)-QSAT, first introduced in SAT'08, can be seen as quantified extended 2-CNF formulas. Until now, within our knowledge, there exists no algorithm presenting the worst upper bound for (1, 2)-QSAT. Therefore in this paper, we present an exact algorithm to solve (1, 2)-QSAT. By analyzing the algorithms, we obtain a worst-case upper bound O(1.4142m), where m is the number of clauses.

READ FULL TEXT
research
06/08/2010

New worst upper bound for #SAT

The rigorous theoretical analyses of algorithms for #SAT have been propo...
research
08/15/2023

Swarm Bug Algorithms for Path Generation in Unknown Environments

In this paper, we consider the problem of a swarm traveling between two ...
research
07/16/2020

Provable Worst Case Guarantees for the Detection of Out-of-Distribution Data

Deep neural networks are known to be overconfident when applied to out-o...
research
10/13/2022

Competition among Parallel Contests

We investigate the model of multiple contests held in parallel, where ea...
research
02/24/2011

New Worst-Case Upper Bound for #XSAT

An algorithm running in O(1.1995n) is presented for counting models for ...
research
05/23/2019

On the Average Case of MergeInsertion

MergeInsertion, also known as the Ford-Johnson algorithm, is a sorting a...
research
07/24/2023

On the Relationship Between Several Variants of the Linear Hashing Conjecture

In Linear Hashing (𝖫𝖧) with β bins on a size u universe 𝒰={0,1,…, u-1}, ...

Please sign up or login with your details

Forgot password? Click here to reset