A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Complicated complementations
Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)
Preserved Fulltext
Kolmogorov complexity has proven to be a very useful tool in simplifying and improving proofs that use complicated combinatorial arguments. In this paper we use Kolmogorov complexity for oracle construction. We obtain separation results that are much stronger than separations obtained previously even with the use of very complicated combinatorial arguments. Moreover the use of Kolmogorov arguments almost trivializes the construction itself. In particular we construct relativized worlds where:
doi:10.1109/ccc.1999.766281
dblp:conf/coco/BuhrmanT99
fatcat:nl5fxjvjinebbbao7gfwknrxvi