"Algorithmic complexity as a criterion of unsolvability."

Mark Burgin (2007)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2007.04.011

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/Burgin07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Burgin07
Mark Burgin:
Algorithmic complexity as a criterion of unsolvability. Theor. Comput. Sci. 383(2-3): 244-259 (2007)

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.