Results 111 to 120 of about 272,983 (311)
The continuous 1.5D terrain guarding problem: Discretization, optimal solutions, and PTAS
In the NP-hard continuous 1.5D Terrain Guarding Problem (TGP) we are given an $x$-monotone chain of line segments in $R^2$ (the terrain $T$), and ask for the minimum number of guards (located anywhere on $T$) required to guard all of $T$.
Stephan Friedrichs +3 more
doaj +1 more source
On the complexity of rationalizing behavior [PDF]
We study the complexity of rationalizing choice behavior. We do so by analyzing two polar cases, and a number of intermediate ones. In our most structured case, that is where choice behavior is defined in universal choice domains and satisfies the "weak ...
Miguel A. Ballester, Jose Apesteguia
core
Liquid‐phase transmission electron microscopy enables direct observation of nucleation and growth processes in solution. This review is dedicated to the remembrance of Helmut Cölfen and highlights recent studies on complex materials—oxides, biominerals, organic–inorganic crystals—which were central to his research activity. It summarizes key milestones,
Charles Sidhoum +5 more
wiley +1 more source
The Identity Problem in the special affine group of $\mathbb{Z}^2$ [PDF]
We consider semigroup algorithmic problems in the Special Affine group $\mathsf{SA}(2, \mathbb{Z}) = \mathbb{Z}^2 \rtimes \mathsf{SL}(2, \mathbb{Z})$, which is the group of affine transformations of the lattice $\mathbb{Z}^2$ that preserve orientation ...
Ruiwen Dong
doaj +1 more source
The NP-completeness of authomorphic colorings
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such that each automorphism of the graph preserves the coloring. The automorphic chromatic index (number) is the least integer k for which G admits an automorphic edge(vertex)coloring with k colors.
openaire +3 more sources
An Alternative proof of SAT NP-Completeness
We give a proof of SAT's NP-completeness based upon a syntaxic characterization of NP given by Fagin at 1974. Then, we illustrate a part of our proof by giving examples of how two well-known problems, MAX INDEPENDENT SET and 3- COLORING, can be expressed
Escoffier, Bruno, Paschos, Vangelis
core
MXene Wrapped Magnetic Mesocrystals for Durable Redox Catalytic Cancer Therapy and Responsive MRI
Conformal wrapping of ultrathin Ti3C2Tx MXene nanosheets on Fe3O4 mesocrystals creates topology‐stabilized Schottky junctions that direct photoinduced electron transfer under NIR irradiation. The unique architecture sustains Fenton catalysis, promotes continuous hydroxyl radical production, and provides photo‐responsive MRI contrast.
Min Jun Ko +10 more
wiley +1 more source
Some complexity results on semipaired domination in graphs
Let [Formula: see text] be a graph without any isolated vertices. A semipaired dominating set [Formula: see text] of G, is a dominating set of G, if D can be partitioned into cardinality 2 subsets such that the vertices in each of these subsets are at ...
Vikash Tripathi, Kusum, Arti Pandey
doaj +1 more source
Query Order and NP-Completeness
The effect of query order on NP-completeness is investigated. A sequence ~ D = (D1 ::: Dk) of decision problems is de ned to be sequentially complete for NP if each Di 2 NP and every problem in NP can be decided in polynomial time with one query to each
Jack H. Lutz, Jack J. Dai
core
Janus Photonic Graphics by Stratified Assembly of Two Distinct Colloids
Double‐sided Janus photonic micropatterns with vivid structural colors are fabricated through a single‐step bottom‐up strategy. Density‐driven stratification and depletion‐mediated crystallization of PMMA and PS binary colloids lead to exclusive lattices on opposite surfaces under centrifugal force.
Young Geon Kim +4 more
wiley +1 more source

