Results 81 to 90 of about 369,293 (294)
Bi-immunity separates strong NP-completeness notions [PDF]
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
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
NP-completeness results for edge modification problems [PDF]
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs have a lot of applications in different areas, and many polynomial-time ...
Guillermo Durán +9 more
core +1 more source
ABSTRACT Background Ischemic stroke, a major cause of mortality and long‐term disability, results from the abrupt cessation of cerebral blood flow due to vascular occlusion or rupture. Icosapent Ethyl (EPA‐EE), approved for hypertriglyceridemia, has anti‐inflammatory and antithrombotic properties that may lessen ischemic damage.
Mitra Mahmoudi Meymand +5 more
wiley +1 more source
Equitable Colorings Of Corona Multiproducts Of Graphs
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the numbers of vertices in any two sets differ by at most one.
Furmánczyk Hanna +2 more
doaj +1 more source
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 +3 more sources
Global Rather Than Vertical‐Selective Saccadic Abnormalities in Progressive Supranuclear Palsy
ABSTRACT Objective To test whether vertical saccades are preferentially affected in Progressive Supranuclear Palsy (PSP). Methods PSP patients (n = 24) were compared to age‐matched controls (n = 94) and two degenerative groups (Alzheimer's disease, n = 20; Lewy body disease, n = 50).
Duy Duan Nguyen +6 more
wiley +1 more source
14 pages, 10 figures, 28 references, to be published in Siberian Electronic Mathematical ...
openaire +2 more sources
Objective Elevated C‐reactive protein (CRP) levels in systemic sclerosis (SSc) have been linked with severe disease and worse survival, but the role of platelet levels remains unclear. This study examined whether elevated platelet levels, CRP levels, or both are associated with disease severity, progression, and survival in SSc.
Brian S. Lee +4 more
wiley +1 more source

