Related papers: A Reply to "On Salum's Algorithm for X3SAT"
We show how one can use certain deterministic algorithms for higher-value constraint satisfaction problems (CSPs) to speed up deterministic local search for 3-SAT. This way, we improve the deterministic worst-case running time for 3-SAT to…
Contributed discussion and rejoinder to "Geodesic Monte Carlo on Embedded Manifolds" (arXiv:1301.6064)
This paper is now part of the new paper "Series with Hermite polynomials and applications" arXiv:1710.00687.
The paper reviews various arithmetic analogues of Hamiltonian systems and presents some new facts suggesting ways to relate/unify these examples.
This is a reply to the Comment on 'Spin Decoherence in Superconducting Atom Chips' [arXiv:quant-ph/0610095 (2006)].
We present the results of a numerical study, with 20 qubits, of the performance of the Quantum Adiabatic Algorithm on randomly generated instances of MAX 2-SAT with a unique assignment that maximizes the number of satisfied clauses. The…
Comment on "Support Vector Machines with Applications" [math.ST/0612817]
Comment on "Support Vector Machines with Applications" [math.ST/0612817]
We analyze to what extent the random SAT and Max-SAT problems differ in their properties. Our findings suggest that for random $k$-CNF with ratio in a certain range, Max-SAT can be solved by any SAT algorithm with subexponential slowdown,…
1-in-3 SAT is an NP-complete variant of 3-SAT\ where a "clause" is satisfied iff exactly one of its three literal is satisfied. We present here an exact algorithm solving \oit\ in time $O^*(1.260^n)$.
The present article is devoted to the description of further investigations of the author of this article. These investigations (in terms of various representations of real numbers) include the generalized Salem functions and…
In a previous paper (q-alg/9501022) we suggested some algorithms that could be useful in solving the problem of knot classification. Here we continue this discussion by answering questions raised in that paper and by commenting on practical…
It is proposed to apply modern methods of nonlinear nonequilibrium statistical mechanics to develop software algorithms that will optimally respond to targets within short response times with minimal computer resources. This Statistical…
A New Trinomial Recombination Tree Algorithm and Its Applications
Rejoinder to ``Boosting Algorithms: Regularization, Prediction and Model Fitting'' [arXiv:0804.2752]
The rigorous theoretical analyses of algorithms for #SAT have been proposed in the literature. As we know, previous algorithms for solving #SAT have been analyzed only regarding the number of variables as the parameter. However, the time…
This paper has been withdrawn.
This article appeared in the September 2024 issue (Vol. 31, No. 3) of the Bulletin of the International Society for Bayesian Analysis (ISBA).
I describe one quantum approach to solving 3-satisfiability (3-SAT), the well known problem in computer science. The approach is based on repeatedly measuring the truth value of the clauses forming the 3-SAT proposition using a…
A Comment on the Letter by C. R. Galley, Phys. Rev. Lett. 110, 174301 (2013).