General Mathematics

    

Discrete Markov Random Field Relaxation

Authors: Sing Kuang Tan

This paper gives a technique to approximate (relaxation) discrete Markov Random Field (MRF) using convex programming. This approximated MRF can be used to approximate NP problem. This also proves that NP is not equal P because the MRF convex programming and the approximate MRF convex programming are not the same with removal of some product terms.

Comments: Number of pages is 6.

Download: PDF

Submission history

[v1] 2021-12-28 01:42:04

Unique-IP document downloads: 254 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus