2060 search results - page 2 / 412 » Some Applications of Coding Theory in Computational Complexi... |
GC
2007
Springer
13 years 5 months ago
2007
Springer
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
CIE
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...
JSYML
2007
13 years 5 months ago
2007
In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique com...
DCC
2008
IEEE
14 years 4 months ago
2008
IEEE
We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order binary Reed-Muller code RM(2, m), of length n = 2m , ...