259 search results - page 2 / 52 » Some New Directions and Questions in Parameterized Complexit... |
ECCC
2010
13 years 6 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
MOBIQUITOUS
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper some research questions which potentially lie within the purview of the new discipline of Computational Transportation Science are presented. Some of these questions...
ECCC
2008
13 years 7 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
— In this article, we investigate a new class of control problems called Ensemble Control, a notion coming from the study of complex spin dynamics in Nuclear Magnetic Resonance (...