Related papers: A Reply to "On Salum's Algorithm for X3SAT"
We comment on Z. D. Zhang's Response [arXiv:0812.2330] to our recent Comment [arXiv:0811.3876] addressing the conjectured solution of the three-dimensional Ising model reported in [arXiv:0705.1045].
We give a new proof of a version of the main theorem of the previous paper in the series about embedding of an algebraic system into ultraproducts.
A determined algorithm is presented for solving the rSUM problem for any natural r with a sub-quadratic assessment of time complexity in some cases. In terms of an amount of memory used the obtained algorithm is the nlog^3(n) order. The…
This erratum corrects the article arXiv:0806.2044 published in Ann. Probab. 36 (2008) 931--970
An extension to the P3M algorithm for electrostatic interactions is presented, that allows to efficiently compute dipolar interactions in periodic boundary conditions. Theoretical estimates for the root-mean square error of the forces,…
I survey results about, and recent applications of, Salem numbers.
Short review article on quantum information processing accepted for Supplement III, Encyclopaedia of Mathematics (publication expected Summer 2001). See also http://www.wkap.nl/series.htm/ENM
We consider the following problem: given three sets of real numbers, output a word-RAM data structure from which we can efficiently recover the sign of the sum of any triple of numbers, one in each set. This is similar to a previous work by…
We present an online method for estimating the cost of solving SAT problems. Modern SAT solvers present several challenges to estimate search cost including non-chronological backtracking, learning and restarts. Our method uses a linear…
This paper is a corrigendum to the article 'On the ideal theorem for number fields`. The main result of this paper proves to be untrue and is replaced by an estimate of a weighted sum with an improved error term.
This note is a reply to Joshua Goodman's paper "Efficient Algorithms for Parsing the DOP Model" (Goodman, 1996; cmp-lg/9604008). In his paper, Goodman makes a number of claims about (my work on) the Data-Oriented Parsing model (Bod,…
The 3-Satisfiability Problem (3-SAT) is a demanding combinatorial problem, of central importance among the non-deterministic polynomial (NP) complete problems, with applications in circuit design, artificial intelligence and logistics. Even…
We formalize a combinatorial principle, called the 3XOR principle, due to Feige, Kim and Ofek (2006), as a family of unsatisfiable propositional formulas for which refutations of small size in any propositional proof system that possesses…
Short review article on quantum computation accepted for Supplement III, Encyclopaedia of Mathematics (publication expected Summer 2001). See also http://www.wkap.nl/series.htm/ENM
Let F be a uniformly distributed random k-SAT formula with n variables and m clauses. Non-rigorous statistical mechanics ideas have inspired a message passing algorithm called Belief Propagation Guided Decimation for finding satisfying…
Max#SAT is an important problem with multiple applications in security and program synthesis that is proven hard to solve. It is defined as: given a parameterized quantifier-free propositional formula compute parameters such that the number…
A common way of solving satisfiability instances with quantum methods is to transform these instances into instances of QUBO, which in itself is a potentially difficult and expensive task. State-of-the-art transformations from MAX-3SAT to…
Comment on [math.ST/0612817]
Rejoinder to ``Support Vector Machines with Applications'' [math.ST/0612817]
The Annals of Applied Probability 16 (2006) 984--1033 [URL: http://projecteuclid.org/euclid.aoap/1151592257]