Join Our Newsletter

CORR

2008

Springer

12 years 2 months ago
2008

Springer

Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...

DM

2002

12 years 3 months ago
2002

We present here a proof that a certain rational function Cn(q, t) which has come to be known as the "q, t-Catalan" is in fact a polynomial with positive integer coeffici...

JCSS

2007

12 years 3 months ago
2007

We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is â™...

IPM

2008

12 years 3 months ago
2008

Exhibiting new features and likely related matching techniques to efficiently retrieve images from databases remains an open problem. This paper is first devoted to such a novel d...

COMBINATORICS

2006

12 years 3 months ago
2006

A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...

ECCC

2008

12 years 3 months ago
2008

Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with onesided error, has been an open problem for years. This note helps to explain why the problem is diffi...

COMBINATORICA

2008

12 years 3 months ago
2008

We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...

CORR

2010

Springer

12 years 3 months ago
2010

Springer

The capacity region of a broadcast channel consisting of k-receivers that lie in a less noisy sequence is an open problem, when k 3. We prove that superposition coding is indeed ...

IJCAI

2003

12 years 5 months ago
2003

The ability to recognize when an agent abandons a plan is an open problem in the plan recognition literature and is a significant problem if these methods are to be applied in rea...

COMPGEOM

1995

ACM

12 years 7 months ago
1995

ACM

We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...