A note on unambiguous function classes
From MaRDI portal
Publication:1607022
DOI10.1016/S0020-0190(99)00142-8zbMath1005.68523OpenAlexW2012182522MaRDI QIDQ1607022
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00142-8
Related Items (2)
UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS ⋮ Cluster computing and the power of edge recognition
Cites Work
- Unnamed Item
- Unnamed Item
- On counting and approximation
- Closure properties and witness reduction
- Complexity classes of optimization functions
- A complexity theory for feasible closure properties
- Bounded Query Classes
- Complexity Measures for Public-Key Cryptosystems
- THE COMPLEXITY OF FINDING MIDDLE ELEMENTS
- UP and the low and high hierarchies: A relativized separation
- The operators min and max on the polynomial hierarchy
This page was built for publication: A note on unambiguous function classes
