Encoding invariance in average case complexity
type: Item
instance of: scholarly article
title: Encoding invariance in average case complexity
zbMATH Open document ID: 1380.68233
published in: Theory of Computing Systems
publication date: 2017-11-07T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q87
zbMATH DE Number: 6803500
zbMATH Keywords: average-case complexity
zbMATH Keywords: polynomial-time samplable distribution
zbMATH Keywords: polynomial-time computable distribution
author: Nikolai K. Vereshchagin
MaRDI profile type: Publication
full work available at URL: s00224-013-9517-5
OpenAlex ID: W2060628418
cites work: Average-Case Complexity
cites work: On the theory of average case complexity
cites work: A Pseudorandom Generator from any One-way Function
cites work: Average Case Complete Problems
DOI: 10.1007/S00224-013-9517-5
description: scientific article; zbMATH DE number 6803500