184 search results - page 34 / 37 » Query Complexity Lower Bounds for Reconstruction of Codes |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract— Infrastructure based wireless communications systems as well as ad hoc networks experience a growing importance in present-day telecommunications. An increased density ...
FOCS
1999
IEEE
14 years 4 days ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
FOCM
2010
13 years 6 months ago
2010
Abstract. An automated method of general purpose is introduced for computing a rigorous estimate of a bounded region in Rn whose points satisfy a given property. The method is base...
SCOPES
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
COCO
2005
Springer
14 years 1 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...