Results 21 to 30 of about 3,990 (244)
Training Variational Quantum Algorithms Is NP-Hard [PDF]
Physical Review Letters, 2021 Variational quantum algorithms are proposed to solve relevant computational problems on near term quantum devices. Popular versions are variational quantum eigensolvers and quantum ap- proximate optimization algorithms that solve ground state problems from quantum chemistry and binary optimization problems, respectively.
Lennart Bittel, Martin Kliesch
openaire +3 more sources
NP-Completeness Results for Minimum Planar Spanners [PDF]
Discrete Mathematics & Theoretical Computer Science, 1998 For any fixed parameter t greater or equal to 1, a t-spanner of a graph G is a spanning subgraph in which the distance between every pair of vertices is at most t times their distance in G.
Ulrik Brandes, Dagmar Handke
doaj +2 more sources
NP-Hardness of the Problem of Optimal Box Positioning
Mathematics, 2019 We consider the problem of finding a position of a d-dimensional box with given edge lengths that maximizes the number of enclosed points of the given finite set P ⊂ R d , i.e., the problem of optimal box positioning.
Alexei V. Galatenko +2 more
doaj +1 more source
Journal of Materials Research and Technology, 2023 Metal matrix composites have various structural and thermal applications in terms of their unique mechanical and thermal properties compared to their counterparts.
Jiangbo Tang +8 more
doaj +1 more source
Inverse Generalized Maximum Flow Problems
Mathematics, 2019 A natural extension of maximum flow problems is called the generalized maximum flow problem taking into account the gain and loss factors for arcs. This paper investigates an inverse problem corresponding to this problem. It is to increase arc capacities
Javad Tayyebi, Adrian Deaconu
doaj +1 more source
International Journal of Dentistry, 2022 This study evaluated the physical and mechanical properties of glass ionomer cement (GIC) associated with 5% hydroxyapatite nanoparticles (NPHAps) and 10% bioactive glass (BAG) 45S5 before and after brushing at different storage times.
Rafael A. Martins +5 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
On Minimum Maximal Distance-k Matchings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge analogue of $k$
Yury Kartynnik, Andrew Ryzhikov
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
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