Results 61 to 70 of about 460,881 (203)
UG-Hardness to NP-Hardness by Losing Half [PDF]
, 2019 The 2-to-2 Games Theorem of [Subhash Khot et al., 2017; Dinur et al., 2018; Dinur et al., 2018; Dinur et al., 2018] implies that it is NP-hard to distinguish between Unique Games instances with assignment satisfying at least (1/2-epsilon) fraction of the
Khot, Subhash, Bhangale, Amey
core +1 more source
MetalsIn this study, the DED-LB/M process of AISI H11 tool steel powder blends modified by adding WC nanoparticles (WC-np) in concentrations of 1, 2.5 and 5 wt.-% was the object of scientific investigations.
Oliver Hentschel +6 more
doaj +1 more source
Grassmannian Optimization Is NP-Hard
SIAM Journal on OptimizationWe show that unconstrained quadratic optimization over a Grassmannian $\operatorname{Gr}(k,n)$ is NP-hard. Our results cover all scenarios: (i) when $k$ and $n$ are both allowed to grow; (ii) when $k$ is arbitrary but fixed; (iii) when $k$ is fixed at its lowest possible value $1$. We then deduce the NP-hardness of unconstrained cubic optimization over
Zehua Lai, Lek-Heng Lim, Ke Ye
openaire +4 more sources
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
Algorithms, 2020 Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results.
Andreas Emil Feldmann +3 more
doaj +1 more source
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes [PDF]
, 2005 The Maximum Independent Set problem in d-box graphs, i.e., in the intersection graphs of axis-parallel rectangles in R d , is a challenge open problem. For any fixed d ≥ 2 the problem is NP-hard and no approximation algorithm with ratio o(log d−1 n) is ...
Chlebikova, Janka +5 more
core
PSPACE-Hard 2D Super Mario Games: Thirteen Doors [PDF]
We prove PSPACE-hardness for fifteen games in the Super Mario Bros. 2D platforming video game series. Previously, only the original Super Mario Bros. was known to be PSPACE-hard (FUN 2016), though several of the games we study were known to be NP-hard ...
Korman, Matias +4 more
core +1 more source
Heuristic algorithms for best match graph editing
Algorithms for Molecular Biology, 2021 Background Best match graphs (BMGs) are a class of colored digraphs that naturally appear in mathematical phylogenetics as a representation of the pairwise most closely related genes among multiple species.
David Schaller +3 more
doaj +1 more source
On Comparing the Similarity and Dissimilarity Between Two Distinct Vehicular Trajectories
IEEE Access, 2021 In this paper, we study the problem of comparing the similarity and dissimilarity between two distinct vehicular trajectories by proposing an adjacency-based metric.
Letu Qingge +4 more
doaj +1 more source
1-Planarity of Graphs with a Rotation System
Journal of Graph Algorithms and Applications, 2015 A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. 1-planarity is known NP-hard, even for graphs of bounded bandwidth, pathwidth, or treewidth, and for near-planar graphs in which an edge is added to a planar
Christopher Auer +3 more
doaj +1 more source
The Power of Human–Algorithm Collaboration in Solving Combinatorial Optimization Problems
Algorithms, 2021 Many combinatorial optimization problems are often considered intractable to solve exactly or by approximation. An example of such a problem is maximum clique, which—under standard assumptions in complexity theory—cannot be solved in sub-exponential time
Tapani Toivonen, Markku Tukiainen
doaj +1 more source