Stasys Jukna. A note on the P versus NP intersected with co-NP question in communication complexity. Electronic Colloquium on Computational Complexity (ECCC), (062), 2004. [doi]
@article{ECCC-TR04-062,
title = {A note on the P versus NP intersected with co-NP question in communication complexity},
author = {Stasys Jukna},
year = {2004},
url = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-062/index.html},
researchr = {https://researchr.org/publication/ECCC-TR04-062},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
number = {062},
}