Centrum Wiskunde & Informatica

How low can approximate degree and quantum query complexity be for total Boolean functions? Tech Report

A. Ambainis (Andris) and R.M. de Wolf (Ronald)

January 2012
Invited plenary lecture at the Milner Memorial Symposium, Edinburgh Lecture

J.J.M.M. Rutten (Jan)

January 2012
Symmetry in RLT cuts for the quadratic assignment and standard quadratic optimization problems Tech Report

E. de Klerk (Etienne), M. Eisenberg-Nagy (Marianna), R. Sotirov (Renata) and U. Truetsch

January 2012
Extra-terrestrial sprites: laboratory investigations in planetary gas mixtures In Proceedings

D. Dubrovin, Y. Yair, C. Price, S. Nijdam (Sander), T.T.J. Clevis, E.M. van Veldhuizen and U. Ebert (Ute)

January 2012
Information distance: New developments Tech Report

P.M.B. Vitányi (Paul)

January 2012
Automated Verification of Recursive Programs with Pointers In Proceedings

F.S. de Boer (Frank), M.M. Bonsangue (Marcello) and J.C. Rot (Jurriaan)

January 2012
Invited lecture at annual meeting of the NVTI Lecture

J.J.M.M. Rutten (Jan)

January 2012
Cross sections and modelling results for TGF- and positron spectrum produced by a negative stepped lightning leader In Proceedings

C. Köhn (Christoph) and U. Ebert (Ute)

January 2012

Previous

Next