Sciweavers

2412 search results - page 25 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
LATA
2009
Springer
14 years 4 months ago
Nondeterministic Instance Complexity and Proof Systems with Advice
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...
Olaf Beyersdorff, Johannes Köbler, Sebastian ...
ICONIP
2010
13 years 8 months ago
Complex Spiking Models: A Role for Diffuse Thalamic Projections in Complex Cortical Activity
Cortical activity exhibits complex, persistent self-sustained dynamics, which is hypothesised to support the brain’s sophisticated processing capabilities. Prior studies have sho...
Peter Stratton, Janet Wiles
IPL
2007
121views more  IPL 2007»
13 years 9 months ago
Parameterized complexity of the induced subgraph problem in directed graphs
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...
Venkatesh Raman, Somnath Sikdar
ICC
2007
IEEE
137views Communications» more  ICC 2007»
14 years 4 months ago
Optimality and Complexity of Opportunistic Spectrum Access: A Truncated Markov Decision Process Formulation
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...
Dejan V. Djonin, Qing Zhao, Vikram Krishnamurthy
ORL
2007
86views more  ORL 2007»
13 years 9 months ago
Complexity of two dual criteria scheduling problems
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...
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao