Showing 1 - 2 results of 2 for search 'Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,', query time: 0.11s Refine Results
  1. 1
    Lower Bound on Expected Communication Cost of Quantum Huffman Coding
    “...Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,...”
    Get fulltext
    Article
  2. 2
    Tight SoS-Degree Bounds for Approximate Nash Equilibria
    “...Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,...”
    Get fulltext
    Article
Search Tools: Get RSS Feed — Email this Search