Results 201 to 210 of about 12,229,216 (240)

The complexity of satisfiability problems

Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78, 1978
The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied. I t is known that, when restricted to formulas having only two literals per clause, this problem has an efficient (polynomial-time) solution.
openaire   +1 more source

Hybrid genetic algorithm in the Hopfield network for maximum 2-satisfiability problem

, 2017
M. Kasihmuddin, S. Sathasivam, M. Mansor
semanticscholar   +1 more source

A quantum annealing approach for Boolean Satisfiability problem

Design Automation Conference, 2016
J. Su, Tianheng Tu, Lei He
semanticscholar   +1 more source

On the parameterized complexity of the workflow satisfiability problem

Conference on Computer and Communications Security, 2012
J. Crampton, G. Gutin, Anders Yeo
semanticscholar   +1 more source

Navigating financial toxicity in patients with cancer: A multidisciplinary management approach

Ca-A Cancer Journal for Clinicians, 2022
Grace Li Smith, Matthew P Banegas, Chiara Acquati, Lmsw   +2 more
exaly  

Completeness of the Bounded Satisfiability Problem for Constraint LTL

Reachability Problems, 2011
M. Bersani, A. Frigeri, Matteo Rossi, P. S. Pietro   +3 more
semanticscholar   +1 more source

Modified extremal optimization for the hard maximum satisfiability problem

Journal of Zhejiang University SCIENCE C, 2011
Guo-qiang Zeng, Yongzai Lu, Weijie Mao
semanticscholar   +1 more source

A New Artificial Immune System for Solving the Maximum Satisfiability Problem

International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, 2010
Abdesslem Layeb, Abdel Hakim Deneche, Souham Meshoul   +2 more
semanticscholar   +1 more source

Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem

SIAM journal on computing (Print), 1986
M. Chao, J. Franco
semanticscholar   +1 more source

Recognizing Disguised NR(1) Instances of the Satisfiability Problem

J. Algorithms, 1980
Bengt Aspvall
semanticscholar   +1 more source