Related papers: A Reply to "On Salum's Algorithm for X3SAT"

In their reply arXiv:1408.2230, the authors corrected some inappropriate sentences and clarified misleading descriptions in their original manuscript arXiv:1407.5194v1.

This is a comment on a recent publication claiming to have found a ``quantum optimization'' algorithm which outperforms known algorithms for minimizing some ``cost function''. Unfortunately, this algorithm is no better than choosing a state…

We would like to congratulate the authors of "A Bayesian Conjugate Gradient Method" on their insightful paper, and welcome this publication which we firmly believe will become a fundamental contribution to the growing field of probabilistic…

This paper is to explore a model of the ABS Algorithms for dealing with a class of systems of linear stochastic equations A xi=eta satisfying eta sim N_m(v, I_{m}). It is shown that the iteration step alpha_{i} is N(V,\pi) and approximation…

For some $\epsilon > 10^{-36}$ we give a randomized $3/2-\epsilon$ approximation algorithm for metric TSP.

We proposed an algorithm that covers some cases of Hamilton Circuit Problem.

A Comment on the paper "Conservative Quantum Computing" by M. Ozawa, Phys. Rev. Lett. 89, 057902 (2002). The author replies in Phys. Rev. Lett. 91, 089802 (2003).

In this paper, we introduce an iterative numerical method to solve systems of nonlinear equations. The third-order convergence of this method is analyzed. Several examples are given to illustrate the efficiency of the proposed method.

Some formulas and speculations are presented relative to integrable systems and quantum mechanics.

This is a comment on Chen et al Letter PRL,100, 232002 (2008).

In this article we determine several theorems and methods for solving linear congruences and systems of linear congruences, and we find the number of distinct solutions. Many examples of solving congruences are given.

An error in the author's paper (Functiones et Approximatio, 37 . pp. 203-211) is corrected.

We have reviewed the comment in [3], posted on arXiv.org concerning our recent work in [1]. We reply to the comment in this paper.

We give an endorsement for Cornacchia's famous algorithm. Thus we do not claim anything new but an approach which is supposed to be simpler than those of previous works written with the same aim.

This is a complementary document for the paper titled "Asynchronous Distributed Gaussian Process Regression for Online Learning and Dynamical Systems".

The results of computational experiments with ABS algorithms for KKT linear systems are reported.

We demonstrate that any logical problem can be solved by Bayesian inference. In this approach, the distinction between complexity classes vanishes. The method is illustrated by solving the 3-SAT problem in polynomial time. Beyond this,…

The SOM algorithm is very astonishing. On the one hand, it is very simple to write down and to simulate, its practical properties are clear and easy to observe. But, on the other hand, its theoretical properties still remain without proof…

In this note, we want to highlight and correct an error in the paper "On the nonlocal Cahn-Hilliard-Brinkman and Cahn-Hilliard-Hele-Shaw systems" [Comm. Pure Appl. Anal. 15 (2016), 299-317] written by the authors.

Remarks on reply (cond-mat/0206368) to Johansen's comment (cond-mat/0205249)