"An analytic upper bound on T-complexity."

Ulrich Speidel, T. Aaron Gulliver (2012)

Details and statistics

DOI: 10.1109/ISIT.2012.6284014

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

a service of  Schloss Dagstuhl - Leibniz Center for Informatics