Results 21 to 30 of about 35,538 (168)
Logarithmic SAT Solution with Membrane Computing
Axioms, 2022 P systems have been known to provide efficient polynomial (often linear) deterministic solutions to hard problems. In particular, cP systems have been shown to provide very crisp and efficient solutions to such problems, which are typically linear with ...
Radu Nicolescu +4 more
doaj +1 more source
NP-HARD ASPECTS IN ANALOGICAL REASONING [PDF]
Bulletin of informatics and cybernetics, 1993 Summary: Analogy is described in terms of predicate logic. The paper considers the complexity of analogical reasoning in which no function symbols except constants are allowed. We show that the problem of deciding whether a given atomic formula can be inferred by analogy is NP-hard.
Furuya, Shinji, Miyano, Satoru
openaire +2 more sources
Review of Swarm Intelligence for Solving Symmetric Traveling Salesman Problem
Qubahan Academic Journal, 2023 Swarm Intelligence algorithms are computational intelligence algorithms inspired from the collective behavior of real swarms such as ant colony, fish school, bee colony, bat swarm, and other swarms in the nature.
Awaz Ahmad Shaban +3 more
doaj +1 more source
Half-duplex routing is NP-hard [PDF]
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2017 Routing is a widespread approach to transfer information from a source node to a destination node in many deployed wireless ad-hoc networks. Today's implemented routing algorithms seek to efficiently find the path/route with the largest Full-Duplex (FD) capacity, which is given by the minimum among the point-to-point link capacities in the path.
Ezzeldin, Yahya H. +3 more
openaire +2 more sources
Complexity of Solutions Combination for the Three-Index Axial Assignment Problem
Mathematics, 2022 In this work we consider the NP-hard three-index axial assignment problem. We formulate and investigate a problem of combining feasible solutions. Such combination can be applied in a wide range of heuristic and approximate algorithms for solving the ...
Lev G. Afraimovich, Maxim D. Emelin
doaj +1 more source
Link crossing number is NP-hard [PDF]
Journal of Knot Theory and Its Ramifications, 2020 We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.
Arnaud de Mesmay +2 more
openaire +4 more sources
PAC-learning of free-fermionic states is NP-hard [PDF]
QuantumFree-fermionic states, also known as matchgates or Gaussian states, are a fundamental class of quantum states due to their efficient classical simulability and their crucial role across various domains of Physics.
Lennart Bittel +3 more
doaj +1 more source
A Heuristic for a Mixed Integer Program using the Characteristic Equation Approach [PDF]
International Journal of Mathematical, Engineering and Management Sciences, 2017 While most linear programming (LP) problems can be solved in polynomial time, pure and mixed integer problems are NP-hard and there are no known polynomial time algorithms to solve these problems.
Philimon Nyamugure +3 more
doaj +1 more source
Automating cutting planes is NP-hard [PDF]
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020 Full version of the conference version at STOC 2020 by the same ...
Göös, Mika +3 more
openaire +2 more sources
Cellular Neural Networks for NP-Hard Optimization
EURASIP Journal on Advances in Signal Processing, 2009 A cellular neural/nonlinear network (CNN) is used for NP-hard optimization. We prove that a CNN in which the parameters of all cells can be separately controlled is the analog correspondent of a two-dimensional Ising-type (Edwards-Anderson) spin-glass ...
Mária Ercsey-Ravasz +2 more
doaj +1 more source