A stochastic limit approach to the SAT problem
Quantum Physics
2007-05-23 v1
Abstract
We propose a new approach to solve an NP complete problem by means of stochastic limit.
Cite
@article{arxiv.quant-ph/0401110,
title = {A stochastic limit approach to the SAT problem},
author = {Luigi Accardi and Masanori Ohya},
journal= {arXiv preprint arXiv:quant-ph/0401110},
year = {2007}
}
Comments
8 pages
Related papers
View all related →
Computational Complexity · Computer Science
An Efficient Method to Transform SAT problems to Binary Integer Linear Programming Problem
Wenxia Guo, Jin Wang, Majun He, Xiaoqin Ren +2
2018-03-28
Numerical Analysis · Mathematics
A Stochastic Approximation for Fully Nonlinear Free Boundary Parabolic Problems
Erhan Bayraktar, Arash Fahim
2013-11-11
Statistical Mechanics · Physics
Statistical Mechanics of an NP-complete Problem: Subset Sum
T. Sasamoto, T. Toyoizumi, H. Nishimori
2007-05-23
Artificial Intelligence · Computer Science
Machine Learning Methods in Solving the Boolean Satisfiability Problem
Wenxuan Guo, Junchi Yan, Hui-Ling Zhen, Xijun Li +2
2023-10-25
Computational Complexity · Computer Science
Spectral and Modular Analysis of #P Problems
Ohad Asor
2016-01-11
Logic in Computer Science · Computer Science
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems
Predrag Janičić
2025-11-25
Logic in Computer Science · Computer Science
SAT-Solving the Poset Cover Problem
Chih-Cheng Rex Yuan, Bow-Yaw Wang
2025-05-08
Probability · Mathematics
Numerical Solutions of Backward Stochastic Differential Equations: A Finite Transposition Method
Penghui Wang, Xu Zhang
2011-06-07
Data Structures and Algorithms · Computer Science
A Probabilistic Approach to The Perfect Sum Problem
Kristof Pusztai
2022-11-29
Computational Complexity · Computer Science
Generic case completeness
Alexei Miasnikov, Alexander Ushakov
2016-06-06
Data Structures and Algorithms · Computer Science
Towards P = NP via k-SAT: A k-SAT Algorithm Using Linear Algebra on Finite Fields
Matt Groff
2015-03-19
Logic in Computer Science · Computer Science
Potential for Polynomial Solution for NP-Complete Problems using Quantum Computation
Neema Rustin Badihian
2025-04-29
Computational Complexity · Computer Science
A Linear Algebra Formulation for Boolean Satisfiability Testing
Chengling Fang, Jiang Liu
2018-08-20
Artificial Intelligence · Computer Science
Solving the Satisfiability Problem Through Boolean Networks
Andrea Roli, Michela Milano
2011-02-01
Data Structures and Algorithms · Computer Science
About Inverse 3-SAT
Xavier Labouze
2013-08-27
Optimization and Control · Mathematics
Confidence-based Reasoning in Stochastic Constraint Programming
Roberto Rossi, Brahim Hnich, S. Armagan Tarim, Steven Prestwich
2015-09-22
Artificial Intelligence · Computer Science
Machine Learning for SAT: Restricted Heuristics and New Graph Representations
Mikhail Shirokikh, Ilya Shenbin, Anton Alekseev, Sergey Nikolenko
2023-07-19
Computational Complexity · Computer Science
P=NP
Selmer Bringsjord, Joshua Taylor
2007-05-23
Discrete Mathematics · Computer Science
Linear Programming Formulation of the Boolean Satisfiability Problem
Moustapha Diaby
2016-10-21
Optimization and Control · Mathematics
An entropy penalized approach for stochastic control problems. Complete version
Thibaut Bourdais, Nadia Oudjane, Francesco Russo
2025-08-05
Computational Complexity · Computer Science
Non-Interlaced SAT is in P
Dr Serge Burckel
2019-03-26
Computational Complexity · Computer Science
The Complexity of 3SAT_N and the P versus NP Problem
Ruijia Liao
2013-11-12
Optimization and Control · Mathematics
An entropy penalized approach for stochastic optimization with marginal law constraints. Complete version
Thibaut Bourdais, Nadia Oudjane, Francesco Russo
2025-03-18
Computational Complexity · Computer Science
NP-Completeness of deciding the feasibility of Linear Equations over binary-variables with coefficients and constants that are 0, 1, or -1
Deepak Ponvel Chermakani
2012-10-23
Exactly Solvable and Integrable Systems · Physics
The Constant Astigmatism Equation. New Exact Solution
Natale Manganaro, Maxim V. Pavlov
2015-06-17