A note on unambiguous function classes

DOI10.1016/S0020-0190(99)00142-8MaRDI QIDQ1607022zbMATH OpenOpenAlexFDO

Authors Sven Kosub

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

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites work

• A complexity theory for feasible closure properties
• Bounded Query Classes
• Closure properties and witness reduction
• Complexity classes of optimization functions
• Complexity Measures for Public-Key Cryptosystems
• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 1142309 (Why is no real title available?)
• On counting and approximation
• THE COMPLEXITY OF FINDING MIDDLE ELEMENTS
• The operators min and max on the polynomial hierarchy
• UP and the low and high hierarchies: A relativized separation

Cited in

(2)

• Cluster computing and the power of edge recognition
• UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS

This page was built for publication: A note on unambiguous function classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607022)