A note on unambiguous function classes
type: Item
instance of: scholarly article
title: A note on unambiguous function classes
zbMATH Open document ID: 1005.68523
DOI: 10.1016/S0020-0190(99)00142-8
author: Sven Kosub
published in: Information Processing Letters
publication date: 2002-07-25T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1771740
MaRDI profile type: Publication
cites work: Complexity Measures for Public-Key Cryptosystems
cites work: Closure properties and witness reduction
cites work: The operators min and max on the polynomial hierarchy
cites work: Q4385525
cites work: On counting and approximation
cites work: A complexity theory for feasible closure properties
cites work: Q3221403
cites work: UP and the low and high hierarchies: A relativized separation
cites work: THE COMPLEXITY OF FINDING MIDDLE ELEMENTS
cites work: Complexity classes of optimization functions
cites work: Bounded Query Classes
full work available at URL: s0020-0190(99)00142-8
OpenAlex ID: W2012182522
description: scientific article; zbMATH DE number 1771740