David W. Juedes, Jack H. Lutz. Completeness and Weak Completeness Under Polynomial-Size Circuits. In Ernst W. Mayr, Claude Puech, editors, STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings. Volume 900 of Lecture Notes in Computer Science, pages 26-37, Springer, 1995.
@inproceedings{JuedesL95,
title = {Completeness and Weak Completeness Under Polynomial-Size Circuits},
author = {David W. Juedes and Jack H. Lutz},
year = {1995},
tags = {completeness},
researchr = {https://researchr.org/publication/JuedesL95},
cites = {0},
citedby = {0},
pages = {26-37},
booktitle = {STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings},
editor = {Ernst W. Mayr and Claude Puech},
volume = {900},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-59042-0},
}