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

Comment on ``Support Vector Machines with Applications'' [math.ST/0612817]

We present a simple randomized algorithm that approximates the number of satisfying assignments of Boolean formulas in conjunctive normal form. To the best of our knowledge this is the first algorithm which approximates #k-SAT for any k >=…

Comment in response to Phys. Rev. Lett. 112, 046401 (2014)

A direct approach to linear backward filtering equations for SDE systems is proposed. This preprint is a corrected version of the paper 1995 in the LMS Lecture Notes combined with another paper by the author on the direct approach to linear…

This paper is a written version of a one hour lecture given on Peter Shor's quantum factoring algorithm.

This is a reply to Professor Yehia Comments in arXiv:1305.0026

The solution-space structure of the 3-Satisfiability Problem (3-SAT) is studied as a function of the control parameter alpha (ratio of number of clauses to the number of variables) using numerical simulations. For this purpose, one has to…

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

Rejoinder: Expert Elicitation for Reliable System Design [arXiv:0708.0279]

PolySAT is a word-level decision procedure supporting bit-precise SMT reasoning over polynomial arithmetic with large bit-vector operations. The PolySAT calculus extends conflict-driven clause learning modulo theories with two key…

By some new recursive algorithms, in this paper, we will give some improvements on Waring's problem.

The aim of this paper is to present an explicit reduction algorithm for Hilbert modular groups over arbitrary totally real number fields. An implementation of the algorithm is available to download from [19]. The exposition is…

Recently a number of randomized 3/4-approximation algorithms for MAX SAT have been proposed that all work in the same way: given a fixed ordering of the variables, the algorithm makes a random assignment to each variable in sequence, in…

We respond to comments on our paper, titled "Instrumental variable estimation of the causal hazard ratio."

This paper refutes the validity of the polynomial-time algorithm for solving satisfiability proposed by Sergey Gubin. Gubin introduces the algorithm using 3-SAT and eventually expands it to accept a broad range of forms of the Boolean…

This paper discusses the problem of the optimisation of the scanning strategy for the Planck mission.

A thesis on some recursive Bayesian filters for data assimilation

The results of this paper have been subsumed by those of our new paper arXiv:0910.1858

We reply to the comment cond-mat/0008098 by Yang, Sun, and Chang on our paper "Theory of Diluted Magnetic Semiconductor Ferromagnetism", Phys. Rev. Lett. 84, 5628 (2000).

In this paper, we examine Yangjun Chen's technical report titled ``The 2-MAXSAT Problem Can Be Solved in Polynomial Time'' [Che23], which revises and expands upon their conference paper of the same name [Che22]. Chen's paper purports to…