All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

What Can Be Efficiently Reduced to the K-random Strings?

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F06%3A00038951" target="_blank" >RIV/67985840:_____/06:00038951 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    What Can Be Efficiently Reduced to the K-random Strings?

  • Original language description

    We investigate the question of whether one can characterize complexity classes ( such as PSPACE or NEXP ) in terms of efficient reducibility to the set of Kolmogorov-random strings R_C. We show that this question cannot be posed without explicitly dealing with issues raised by the choice of universal machine in the definition of Kolmogorov complexity. Among other results, we show that although for every universal machine U, there are very complex sets that are poly-time dtt-reducible to R_{C_U}, it is nonetheless true that P=the set of all decidable sets in the intersection, over all universal machines U, of the sets that are poly-time dtt-reducible to R_{C_U|. We also show for a broad class of reductions that the sets reducible to R_C have small circuit complexity.

  • Czech name

    Co se dá efektivně zredukovat na Kolmogorovsky náhodné řetízky?

  • Czech description

    Studujeme, jak výpočetně složité množiny se dají redukovat na množinu Kolmogorovsky náhodných řetízků.

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2006

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Annals of Pure and Applied Logic

  • ISSN

    0168-0072

  • e-ISSN

  • Volume of the periodical

    138

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    18

  • Pages from-to

    2-19

  • UT code for WoS article

  • EID of the result in the Scopus database