## Relativizable And Nonrelativizable Theorems In The Polynomial Theory Of Algorithms (1993)

Venue: | In Russian |

Citations: | 36 - 0 self |

### BibTeX

@INPROCEEDINGS{Vereshchagin93relativizableand,

author = {Nikolai K. Vereshchagin},

title = {Relativizable And Nonrelativizable Theorems In The Polynomial Theory Of Algorithms},

booktitle = {In Russian},

year = {1993},

pages = {57--51}

}

### Years of Citing Articles

### OpenURL

### Abstract

. Starting with the paper of Baker, Gill and Solovay [BGS 75] in complexity theory, many results have been proved which separate certain relativized complexity classes or show that they have no complete language. All results of this kind were, in fact, based on lower bounds for boolean decision trees of a certain type or for machines with polylogarithmic restrictions on time. The following question arises: Are these methods of proving "relativized" results universal? In the first part of the present paper we propose a general framework in which assertions of universality of this kind may be formulated and proved as convenient criteria. Using these criteria we obtain, as easy consequences of the known results on boolean decision trees, some new "relativized" results and new proofs of some known results. In the second part of the present paper we apply these general criteria to many particular cases. For example, for many of the complexity classes studied in the literature all relativiza...