×

Found 50 Documents (Results 1–50)

Polynomials, quantum query complexity, and Grothendieck’s inequality. (English) Zbl 1380.68184

Raz, Ran (ed.), 31st conference on computational complexity, CCC’16, Tokyo, Japan, May 29 – June 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-008-8). LIPIcs – Leibniz International Proceedings in Informatics 50, Article 25, 19 p. (2016).
MSC:  68Q12 06E30 94C10
PDF BibTeX XML Cite
Full Text: DOI arXiv

Quasi-randomness and algorithmic regularity for graphs with general degree distributions. (English) Zbl 1171.05411

Arge, Lars (ed.) et al., Automata, languages and programming. 34th international colloquium, ICALP 2007, Wrocław, Poland, July 9–13, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73419-2/pbk). Lecture Notes in Computer Science 4596, 789-800 (2007).
MSC:  05C80 05C07
PDF BibTeX XML Cite
Full Text: DOI Link

On an extremal problem originating in questions of unconditional convergence. (English) Zbl 0994.47029

Haussmann, Werner (ed.) et al., Recent progress in multivariate approximation. Proceedings of the 4th international conference, Witten-Bommerholz, Germany, September 24-29, 2000. Basel: Birkhäuser. ISNM, Int. Ser. Numer. Math. 137, 185-192 (2001).
MSC:  47B34 46B20 46B15
PDF BibTeX XML Cite

Problem list. (English) Zbl 0552.47001

Spectral theory of linear operators and related topics, 8th Int. Conf. Oper. Theory, Timişoara & Herculane/Rom. 1983, Oper. Theory, Adv. Appl. 14, 301-306 (1984).

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field