Results 51 to 60 of about 3,990 (244)
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 +3 more sources
Unique Perfect Phylogeny Is NP-Hard [PDF]
, 2011 We answer, in the affirmative, the following question proposed by Mike Steel as a $100 challenge: "Is the following problem NP-hard? Given a ternary phylogenetic X-tree T and a collection Q of quartet subtrees on X, is T the only tree that displays Q ?"
Habib, Michel, Stacho, Juraj
openaire +2 more sources
Advanced Functional Materials, EarlyView.Development of a transparent, self‐sanitizing antimicrobial coating technology applicable to a wide range of materials and surfaces‐including touchscreens, transparent substrates, and metal, plastic, and glass‐regardless of pathogen type. The spray‐coated, UV‐cross‐linked imidazole‐based quaternary ammonium chloride materials provide broad‐spectrum ...
Surjith Kumaran +6 more
wiley +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
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
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
Bioinspired Stabilization of Fluorescent Au@SiO2 Tracers for Multimodal Biological Imaging
Advanced Functional Materials, EarlyView.This study demonstrates a bioinspired stabilization strategy for fluorescent gold‐silica nanoparticles. Inspired by natural biosilica maturation, high‐temperature calcination transforms the silica shells, preventing dissolution in cell culture media and intracellular environments.
Wang Sik Lee +5 more
wiley +1 more source
Alignment of cluster complexity at network systems [PDF]
FME Transactions, 2019 This paper considers data management structures and cluster technologies in large-scale networks. Suboptimal network partitioning problems are formulated on the base of complexity index alignment.
Enaleev A.K., Ciganov Vladimir V.
doaj
Nanothermometry in Living Cells: Physical Limits, Conceptual and Material Challenges
Advanced Functional Materials, EarlyView.Heat and temperature are fundamental to life. When nanothermometers began probing regions as small as a living cell, they triggered controversial claims of large intracellular temperature gradients. We review physical constraints energy‐conservation, entropy production, thermodynamic fluctuations, and molecular dynamics.
Taras Plakhotnik
wiley +1 more source
Computing Heegaard Genus is NP-Hard [PDF]
, 2017 Version for publication. To appear in the collection of papers "A Journey through Discrete Mathematics. A Tribute to Jiri Matousek" edited by Martin Loebl, Jaroslav Nesetril and Robin Thomas, to be published by ...
Bachman, David +2 more
openaire +2 more sources