Results 81 to 90 of about 272,983 (311)
ABSTRACT Objective This study aimed to investigate the immunological response to influenza vaccination, the incidence and severity of influenza infection, and the side effects of the vaccination in patients with ischemic stroke. Methods This prospective observational study was conducted between 2023 and 2024 at Ramathibodi Hospital.
Achiraya Pakngao +5 more
wiley +1 more source
Wataridori is a pencil puzzle that involves drawing paths in a rectangular grid to connect circles into pairs while satisfying several constraints. In this paper, we prove that deciding whether a given Wataridori puzzle has a solution is NP-complete via a reduction from Numberlink, another pencil puzzle that has previously been proved NP-complete.
openaire +2 more sources
Yosenabe is one of Nikoli's pencil puzzles, which is played on a rectangular grid of cells. Some of the cells are colored gray, and two gray cells are considered connected if they are adjacent vertically or horizontally. A set of connected gray cells is called a gray area.
openaire +2 more sources
ABSTRACT Introduction/Objective Acute intracranial stenting during endovascular thrombectomy (EVT) for ischemic stroke requires intraprocedural antiplatelet therapy (APT) to maintain patency. However, the hemorrhagic risk of combining APT with intravenous thrombolysis (IVT) remains uncertain.
Aaron Rodriguez‐Calienes +75 more
wiley +1 more source
Computing quantum discord is NP-complete
We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete.
Yichen Huang
doaj +1 more source
Stress Measures in SOM Learning
Various stress measures can be used in generalized version of Sammon’s mapping. Kohonen SOM with iterative or batch learning is a standard tool for data self-organization, too.
Zuzana Krbcova, Jaromir Kukal
doaj +1 more source
Bi-immunity separates strong NP-completeness notions
We prove that if for some ϵ>0, NP contains a set that is DTIME(2nϵ)-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-truth-table complete for NP.
Selman, Alan L., Pavan, A.
core +1 more source
ABSTRACT Objective To determine whether integration of serum neurofilament light chain (NfL) and cortical dysfunction improves diagnostic accuracy in amyotrophic lateral sclerosis (ALS) when applied alongside the Gold Coast criteria (GCC). Methods In this prospective study, 148 participants with suspected ALS were recruited (101 ALS and 47 with ALS ...
Aicee Dawn Calma +16 more
wiley +1 more source
14 pages, 10 figures, 28 references, to be published in Siberian Electronic Mathematical ...
openaire +2 more sources
In a Kurdoko puzzle,one must colour some squares in a grid black in a way that satisfies non-overlapping, non-adjacency, reachability and numeric constraints specified by the numeric clues in the grid. We show that deciding the solvability of Kurodoko puzzles is NP-complete.
openaire +1 more source

