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 number of unsatisfied clauses, u. Quite generally, the number of satisfying assignments turns out to be limited by 2 2 2 2 / ( ( ) ) u u E u   wh...

We are interested in the approximation of functions f ~ Lp(I), 0 < p < 1, I = [ 1 , 1], by algebraic polynomials. Such approximation has previously been studied by other authors, most notably, Storozhenko, Krotov, and Oswald [-S-K-O] and Khodak [K]. Our main departure from these previous works is that we shall prove direct estimates for the error of polynomial approximation in terms of the Ditz...

An algorithm is given for calculating the solution to the 3D inverse scattering problem with noisy discrete fixed energy data. The error estimates for the calculated solution are derived. The methods developed are of general nature and can be used in many applications: in nondestructive evaluation and remote sensing, in geophysical exploration, medical diagnostics and technology.

We prove that P ≠ NP by proving the existence of a class of functions we call Τ (Greek Tau), each of whose members satisfies the conditions of one-way functions. Each member of Τ is a function computable in polynomial time, with negligible probability of finding its inverse by any polynomial probabilistic algorithm. We also prove that no polynomial-time algorithm exists to compute the inverse o...

We introduce a method and algorithm for computing the weighted MoorePenrose inverse of multiple-variable polynomial matrix and the related algorithm which is appropriated for sparse polynomial matrices. These methods and algorithms are generalizations of algorithms developed in [24] to multiple variable rational and polynomial matrices and improvements of these algorithms on sparse matrices. Al...