Results 251 to 260 of about 149,306 (281)

The Parameterized Complexity of Stabbing Rectangles

Algorithmica, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dom, Michael, Fellows, Michael R., Rosamond, Frances A., Sikdar, Somnath   +3 more
openaire   +2 more sources

Current treatment and recent progress in gastric cancer

Ca-A Cancer Journal for Clinicians, 2021
Smita S Joshi, Brian D Badgwell
exaly  

Clinical management of metastatic colorectal cancer in the era of precision medicine

Ca-A Cancer Journal for Clinicians, 2022
, Davide Ciardiello, Giulia Martini
exaly  

Oncologic emergencies and urgencies: A comprehensive review

Ca-A Cancer Journal for Clinicians, 2022
Bonnie Gould Rothberg, David E Gerber, Jason J Bischof   +2 more
exaly  

Parameterized Complexity

1999
R. G. Downey, M. R. Fellows
openaire   +1 more source

Descriptive and Parameterized Complexity

1999
Descriptive Complexity Theory studies the complexity of problems of the following type: Given a finite structure A and a sentence Τ of some logic L, decide if A satisfies Τ? In this survey we discuss the parameterized complexity of such problems. Basically, this means that we ask under which circumstances we have an algorithm solving the problem ...
openaire   +2 more sources

A Parameterized Complexity Tutorial

2012
The article was prepared for the LATA 2012 conference where I will be presenting two one and half hour lectures for a short tutorial on parameterized complexity. Much fuller accounts can be found in the books Downey-Fellows [33, 34], Niedermeier [72], Flum-Grohe [49], the two issues of the Computer Journal [36] and the recent survey Downey-Thilikos [39]
openaire   +1 more source

Dynamical memristors for higher-complexity neuromorphic computing

Nature Reviews Materials, 2022
Suhas Kumar, Xinxin Wang, John Paul Strachan   +2 more
exaly  

Parameterized Complexity and Logic

2007
We introduce and discuss some basic concepts of parameterized complexity theory via model-checking problems.
openaire   +1 more source

Non-uniform Parameterized Complexity

2019
Traditional computational complexity research has shown that there is a close relation between the Polynomial Hierarchy and the concept of non-uniformity.
openaire   +1 more source