Discrete mathematics

Mathematics

Boolean satisfiability problem

Maximum satisfiability problem

Algorithm

Artificial intelligence

Satisfiability

Boolean function

Computer science

Hopfield network

Theoretical computer science

Artificial neural network

Applied Soft Computing

Current studies on non-systematic satisfiability in Discrete Hopfield Neural Network are able to avoid production of repetitive final neuron states wh…

Weighted Random k Satisfiability for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e4005" altimg="si2.svg"><mml:mrow><mml:mi>k</mml:mi><mml:mo linebreak="goodbreak" linebreakstyle="after">=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math> (r2SAT) in Discrete Hopfield Neural Network

Weighted Random k Satisfiability for k=1,2 (r2SAT) in Discrete Hopfield Neural Network