On relationships between approximate and probabilistic complexity classes

zbMATH Open0806.68047MaRDI QIDQ1326985FDOQ1326985

Authors: Guangyuan Li, Li Xiang 

Publication date: 15 June 1994

Published in: Science in China. Series A (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4027449
• scientific article; zbMATH DE number 227415
• scientific article; zbMATH DE number 1670534
• scientific article; zbMATH DE number 88935
• On Approximation Algorithms for # P

zbMATH Keywords

exponential-time approximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (6)

• On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes
• Title not available (Why is that?)
• On the relation between descriptional complexity and algorithmic probability
• On the Structure of Logspace Probabilistic Complexity Classes
• On the \(\delta \to 0\) limit in probabilistic complexity
• Title not available (Why is that?)

This page was built for publication: On relationships between approximate and probabilistic complexity classes

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