Related papers: Generalized cofactors and decomposition of Boolean…
Dependency quantified Boolean formulas (DQBF) is a logic admitting existential quantification over Boolean functions, which allows us to elegantly state synthesis problems in verification such as the search for invariants, programs, or…
In this paper, we analyze the argument made by Kumar in the technical report "Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and Its Implications on P versus NP problem." The paper claims to present a…
There exists only one generalization of the classical Boltzmann-Gibbs-Shannon entropy functional to a one-parametric family of additive entropy functionals. We find analytical solution to the corresponding extension of the classical…
Local consistency arises in diverse areas, including Bayesian statistics, relational databases, and quantum foundations, and so does the notion of functional dependence. We adopt a general approach to study logical inference in a setting…
This paper addresses structured normwise, mixed, and componentwise condition numbers (CNs) for a linear function of the solution to the generalized saddle point problem (GSPP). We present a general framework that enables us to measure the…
In this paper has been considered probability-one global convergence of NFPH (Newton-Fixed Point Homotopy) algorithm for system of nonlinear equations and has been proposed a probability-one homotopy algorithm to solve a regularized…
Basic results in combinatorial mathematics provide the foundation for a theory and calculus for reasoning about sequential behavior. A key concept of the theory is a generalization of Boolean implicant which deals with statements of the…
Consider the following decision problem: for a given monotone Boolean function $f$ decide, whether $f$ is read-once. For this problem, it is essential how the input function $f$ is represented. Our contribution consists of the following two…
We study the functional equation \[ \sum_{i=1}^mf_i(b_ix+c_iy)= \sum_{k=1}^nu_k(y)v_k(x) \] with $x,y\in\mathbb{R}^d$ and $b_i,c_i\in {GL}(d,\mathbb{R})$, both in the classical context of continuous complex-valued functions and in the…
We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…
We introduce the concept of {\it generalized reducibility}, which provides a flexible framework for analyzing the long-time behavior of solutions to quadratic quantum Hamiltonians. As an application of this notion, for many prescribed…
In this work, we give the general solution sequential linear conformable fractional differential equations in the case of constant coefficients for {\alpha}(\in)(0,1]. In homogeneous case, we use a fractional exponential function which…
This paper addresses the Bayesian calibration of dynamic models with parametric and structural uncertainties, in particular where the uncertain parameters are unknown/poorly known spatio-temporally varying subsystem models. Independent…
Boolean Satisfiability solvers have gone through dramatic improvements in their performances and scalability over the last few years by considering symmetries. It has been shown that by using graph symmetries and generating symmetry…
Solutions to a class of differential systems that generalize the Halphen system are determined in terms of automorphic functions whose groups are commensurable with the modular group. These functions all uniformize Riemann surfaces of genus…
The study is made of the problem of multiple interpolation on an infinite nodes set by the sums of absolutely convergent series of exponentials whose exponents are from a given set. For entire function conditions on nodes and exponents are…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
A classical question of propositional logic is one of the shortest proof of a tautology. A related fundamental problem is to determine the relative efficiency of standard proof systems, where the relative complexity is measured using the…
We present an approach to propagation based solving, Boolean equi-propagation, where constraints are modelled as propagators of information about equalities between Boolean literals. Propagation based solving applies this information as a…
We present an approach to propagation-based SAT encoding of combinatorial problems, Boolean equi-propagation, where constraints are modeled as Boolean functions which propagate information about equalities between Boolean literals. This…