scientific article

From MaRDI portal

Revision as of 11:33, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3751001

Jump to:navigation, search

zbMath0611.68016MaRDI QIDQ3751001

Dung T. Huynh

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

randomness Church randomness almost everywhere hard languages descriptional complexity of Boolean circuits and formulas exponential- size circuits and formulas Kolmogorov complexity of languages Kolmogorov-random languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (9)

On solving hard problems by polynomial-size circuits ⋮ Random languages for nonuniform complexity classes ⋮ Nonuniform complexity and the randomness of certain complete languages ⋮ Almost everywhere high nonuniform complexity ⋮ On problems for which no oracle can help ⋮ Circuit size relative to pseudorandom oracles ⋮ Effective entropies and data compression ⋮ Resource bounded randomness and computational complexity ⋮ An upward measure separation theorem

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3751001&oldid=17287300"