Search results
- 1.0386317 - MÚ 2013 RIV US eng C - Conference Paper (international conference)
Ada, A. - Chattopadhyay, A. - Cook, S.A. - Fontes, L. - Koucký, Michal - Pitassi, T.
The hardness of being private.
2012 IEEE 27th Annual Conference on Computational Complexity (CCC). New York: IEEE, 2012, s. 192-202. Annual IEEE Conference on Computational Complexity. ISBN 978-0-7695-4708-4. ISSN 1093-0159.
[Computational Complexity (CCC), 2012 IEEE 27th Annual Conference. Porto (PT), 26.06.2012-29.6.2012]
R&D Projects: GA ČR GAP202/10/0854; GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : privacy * communication complexity * Vickrey auctions
Subject RIV: BA - General Mathematics
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6243395
Permanent Link: http://hdl.handle.net/11104/0215655File Download Size Commentary Version Access Koucky.pdf 1 351.6 KB Publisher’s postprint require - 2.0385827 - MÚ 2013 RIV US eng C - Conference Paper (international conference)
Filmus, Y. - Lauria, M. - Norström, J. - Thapen, Neil - Ron-Zewi, N.
Space complexity in polynomial calculus.
2012 IEEE 27th Annual Conference on Computational Complexity (CCC). New York: IEEE, 2012, s. 334-344. Annual IEEE Conference on Computational Complexity. ISBN 978-0-7695-4708-4. ISSN 1093-0159.
[27th Annual IEEE Conference on Computational Complexity (CCC). Porto (PT), 26.06.2012-29.06.2012]
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : cutting-plane proofs * lower bounds * hard examples
Subject RIV: BA - General Mathematics
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6243410
Permanent Link: http://hdl.handle.net/11104/0007486File Download Size Commentary Version Access Thapen.pdf 1 276.8 KB Author’s postprint require