scientific article; zbMATH DE number 4064488

MaRDI QIDQ3798240zbMATH OpenFDO

Authors Marek Piotrów

Publication date 1988

zbMATH Keywords

alternating Turing machineapproximate countingoraclerecursive set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the complexity of counting in the polynomial hierarchy
• Polynomial Space Counting Problems
• scientific article; zbMATH DE number 4066859
• scientific article; zbMATH DE number 1670534
• The relative complexity of approximate counting problems

Cited in

(12)

• On counting and approximation
• On the power of enumerative counting
• Locating P/poly optimally in the extended low hierarchy
• Complexity dichotomies of counting problems
• Counting Value Sets: Algorithm and Complexity
• On the complexity of calculating factorials
• scientific article; zbMATH DE number 4066859 (Why is no real title available?)
• scientific article; zbMATH DE number 850077 (Why is no real title available?)
• Counting CTL
• scientific article; zbMATH DE number 7075922 (Why is no real title available?)
• On the complexity of counting in the polynomial hierarchy
• A note on enumerative counting

This page was built for publication:

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