No. Title Author Year
1 Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121) Gal, Anna et al. 2014
2 Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length Gal, Anna et al. 2011
3 Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity Ford, Jeff et al. 2006
4 Incremental branching programs Gál, Anna et al. 2006
5 The Cell Probe Complexity of Succinct Data Structures Gál, Anna et al. 2006
Current Page :
Number of result pages: 1
Number of documents: 5

DROPS-Home | Fulltext Search | Imprint Published by LZI