"What can be efficiently reduced to the Kolmogorov-random strings?"

Eric Allender, Harry Buhrman, Michal Koucký (2006)

> Home

Details and statistics

DOI: 10.1016/J.APAL.2005.06.003

access: closed

type: Journal Article

metadata version: 2020-07-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/apal/AllenderBK06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/apal/AllenderBK06
Eric Allender, Harry Buhrman, Michal Koucký:
What can be efficiently reduced to the Kolmogorov-random strings? Ann. Pure Appl. Log. 138(1-3): 2-19 (2006)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.