STACS 2003. 20th annual symposium of theoretical aspects on computer science, Berlin, Germany, February 27 -- March 1, 2003. Proceedings

DOI10.1007/3-540-36494-3zbMath1017.00027OpenAlexW4250552665MaRDI QIDQ1397207

No author found.

Publication date: 25 July 2003

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://link.springer.de/link/service/series/0558/tocs/t2607.htm

zbMATH Keywords

Berlin (Germany)STACS 2003Theoretical aspects of computer science

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Theory of computing (68Qxx)

Related Items (1)

Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND

This page was built for publication: STACS 2003. 20th annual symposium of theoretical aspects on computer science, Berlin, Germany, February 27 -- March 1, 2003. Proceedings