2412 search results - page 25 / 483 » Which Problems Have Strongly Exponential Complexity |
123
click to vote
LATA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
105
Voted
ICONIP
2010
14 years 11 months ago
2010
Cortical activity exhibits complex, persistent self-sustained dynamics, which is hypothesised to support the brain’s sophisticated processing capabilities. Prior studies have sho...
115
click to vote
IPL
2007
15 years 17 days ago
2007
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
94
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...
80
Voted
ORL
2007
15 years 4 days ago
2007
In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. Both problems are single machine scheduling problem...