Complicated Complementations

نویسندگان

  • Harry Buhrman
  • Leen Torenvliet
چکیده

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: 1. NP \ CoNP = 2 P=poly. 2. NP has a set that is both simple and NP \ CoNP-immune. 3. CoNP has a set that is both simple and NP \ CoNP-immune. 4. p 2 has a set that is both simple and p 2 \ p 2-immune.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The verbal valency in the Prague Dependency Treebank from the annotator's point of view

The core ingredient of the Prague Dependency Treebank (PDT; see Hajič, this volume) „valency“ indicates the capability of lexical units to combine other complementations. The PDT has adopted the concept of the valency theory of the Functional Generative Description (FGD) (see Sgall, 1967, Sgall et al, 1986). The valency theory of the FGD has first been developed for verbs, then also for other p...

متن کامل

Subtraction-like Operations in Nearsemilattices

A nearsemilattice is a poset having the upper-bound property. A binary operation − on a poset with the least element 0 is said to be subtraction-like if x ≤ y if and only if x − y = 0 for all x, y. Associated with such an operation is a family of partial operations lp defined by lp(x) := p − x on every initial segment [0, p]; these operations are thought of as local (sectional) complementations...

متن کامل

To Pay or to Get Paid: Enriching a Valency Lexicon with Diatheses

Valency lexicons typically describe only unmarked usages of verbs (the active form); however verbs prototypically enter different surface structures. In this paper, we focus on the so-called diatheses, i.e., the relations between different surface syntactic manifestations of verbs that are brought about by changes in the morphological category of voice, e.g., the passive diathesis. The change i...

متن کامل

ar X iv : q ua nt - p h / 04 05 02 3 v 2 15 S ep 2 00 4 An efficient algorithm to recognize local Clifford equivalence of graph states

In [Phys. Rev. A 69, 022316 (2004)] we presented a description of the action of local Clifford operations on graph states in terms of a graph transformation rule, known in graph theory as local complementation. It was shown that two graph states are equivalent under the local Clifford group if and only if there exists a sequence of local complementations which relates their associated graphs. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999