NP-hardness of approximating meta-complexity: a cryptographic approach (scientific article; zbMATH DE number 7844654)

From MaRDI portal

(Redirected from NP-hardness of approximating meta-complexity: a cryptographic approach (scientific article; zbMATH DE number 7844654))

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=NP-hardness_of_approximating_meta-complexity:_a_cryptographic_approach_(scientific_article;_zbMATH_DE_number_7844654)&oldid=99674048"