Sciweavers

27 search results - page 2 / 6
» Using nondeterminism to amplify hardness
Sort
View
ICCSA
2009
Springer
14 years 2 days ago
Hybrid Hard/Soft Decode-and-Forward Relaying Protocol with Distributed Turbo Code
This paper proposes a hybrid hard/soft decode-and-forward (DF) relaying protocol with distributed turbo code (DTC), based on error detection in cooperative communications. In order...
Taekhoon Kim, Dong In Kim
ECCC
2010
80views more  ECCC 2010»
13 years 5 months ago
Query Complexity in Errorless Hardness Amplification
An errorless circuit for a boolean function is one that outputs the correct answer or "don't know" on each input (and never outputs the wrong answer). The goal of e...
Thomas Watson
ECCC
2010
124views more  ECCC 2010»
13 years 5 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
ECCC
2006
116views more  ECCC 2006»
13 years 5 months ago
Uniform Hardness Amplification in NP via Monotone Codes
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul...
SPE
2008
126views more  SPE 2008»
13 years 5 months ago
ANTLRWorks: an ANTLR grammar development environment
Programmers tend to avoid using language tools, resorting to ad-hoc methods, because tools can be hard to use, their parsing strategies can be difficult to understand and debug, a...
Jean Bovet, Terence Parr