Nada

Christer's publications

Symmetric Approximation Arguments for Monotone Lower Bounds without Sunflowers
Christer Berg and Staffan Ulfberg
To appear in the journal Computational Complexity Postscript.
A Lower Bound for Perceptrons and an Oracle Separation of the PP^PH Hierarchy
Christer Berg and Staffan Ulfberg
Conference version in Proceedings, Computational Complexity 97
To appear in Journal of Computer and System Sciences Postscript.
On the BPP Hierarchy Problem
Christer Berg and Johan Håstad
Technical report TRITA-NA-9702, Royal Institute of Tecnology, 1997 Postscript.
On Oracles and Circuits-Topics in Computational Complexity
Christer Berg
Doctoral Dissertation, Royal Institute of Tecnology, 1997 Postscript.

^ Up to Research, Theory group at Nada, KTH.


Responsible for this page: <infomaster@nada.kth.se>
Latest change December 23, 1997
Technical support: <webmaster@nada.kth.se>