2060 search results - page 6 / 412 » Some Applications of Coding Theory in Computational Complexi... |
120
click to vote
SIGECOM
2011
ACM
14 years 13 days ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
105
click to vote
FROCOS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
101
click to vote
WG
2009
Springer
15 years 4 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
AAAI
1990
14 years 10 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
80
Voted
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...