Title :
[Copyright notice]
Abstract :
The following topics are dealt with: coin problem, pseudorandom generators; two-party differential privacy; polynomial learning; polynomial learnability; optimal stochastic planarization; monotone complexity; linear systems; fast approximation algorithm; vertex sparsifiers; colorable graphs; information cost tradeoffs; fault tolerance; decidable dichotomy theorem; sublinear optimization; cryptography; minimum cost network design; computational complexity; local list decoding; and backyard cuckoo hashing.
Keywords :
computational complexity; cryptography; data privacy; decoding; fault tolerance; graph colouring; learning (artificial intelligence); optimisation; polynomial approximation; backyard cuckoo hashing; coin problem; colorable graphs; computational complexity; cryptography; decidable dichotomy theorem; fast approximation algorithm; fault tolerance; information cost tradeoffs; linear systems; local list decoding; minimum cost network design; monotone complexity; optimal stochastic planarization; polynomial learnability; polynomial learning; pseudorandom generators; sublinear optimization; two-party differential privacy; vertex sparsifiers;
Conference_Titel :
Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on
Conference_Location :
Las Vegas, NV
Print_ISBN :
978-1-4244-8525-3
DOI :
10.1109/FOCS.2010.3
