Zobrazeno 1 - 10
of 56
pro vyhledávání: '"Schuh, Bernd"'
Autor:
Schuh, Bernd R.
Necessary and sufficient conditions for the existence of an integer solution of the diophantine equation $m/n=1/x(\lambda)+1/y(\lambda)+1/z(\lambda)$ with $n=b+a\lambda$ are explicitly given for a,b coprime and a not a multiple of m . The solution ha
Externí odkaz:
http://arxiv.org/abs/2404.01307
Autor:
Schuh, Bernd. R.
The paper explores the correspondence between balanced incomplete block designs (BIBD) and certain linear CNF formulas by identifying the points of a block design with the clauses of the Boolean formula and blocks with Boolean variables. Parallel cla
Externí odkaz:
http://arxiv.org/abs/2010.02922
Autor:
Schuh, Bernd R.
The study of regular linear conjunctive normal form (LCNF) formulas is of interest because exact satisfiability (XSAT) is known to be NP-complete for this class of formulas. In a recent paper it was shown that the subclass of regular exact LCNF formu
Externí odkaz:
http://arxiv.org/abs/1812.09110
Autor:
Schuh, Bernd
We derive an upper bound on the number of models for exact satisfiability (XSAT) of arbitrary CNF formulas F. The bound can be calculated solely from the distribution of positive and negated literals in the formula. For certain subsets of CNF instanc
Externí odkaz:
http://arxiv.org/abs/1803.07376
Publikováno v:
In Journal of Cleaner Production 10 March 2022 339
Autor:
Schuh, Bernd. R.
Open questions with respect to the computational complexity of linear CNF formulas in connection with regularity and uniformity are addressed. In particular it is proven that any l-regular monotone CNF formula is XSAT-unsatisfiable if its number of c
Externí odkaz:
http://arxiv.org/abs/1711.07474
Autor:
Schuh, Bernd R.
A generalized 1-in-3SAT problem is defined and found to be in complexity class P when restricted to a certain subset of CNF expressions. In particular, 1-in-kSAT with no restrictions on the number of literals per clause can be decided in polynomial t
Externí odkaz:
http://arxiv.org/abs/1707.00118
Autor:
Schuh, Bernd R.
Limits on the number of satisfying assignments for CNS instances with n variables and m clauses are derived from various inequalities. Some bounds can be calculated in polynomial time, sharper bounds demand information about the distribution of the n
Externí odkaz:
http://arxiv.org/abs/1705.05452
Autor:
Schuh, Bernd R.
A heuristic model procedure for determining satisfiability of CNF-formulae is set up and described by nonlinear recursion relations for m (number of clauses), n (number of variables) and clause filling k. The system mimicked by the recursion undergoe
Externí odkaz:
http://arxiv.org/abs/1411.2901
Autor:
Schuh, Bernd R.
The aim of this short note is mainly pedagogical. It summarizes some knowledge about Boolean satisfiability (SAT) and the P=NP? problem in an elementary mathematical language. A convenient scheme to visualize and manipulate CNF formulae is introduced
Externí odkaz:
http://arxiv.org/abs/1408.3286