A Survey of the Distributional Complexity for AND-OR Trees

DOI10.1142/9789811259296_0004MaRDI QIDQ6135563zbMATH OpenOpenAlexFDO

Authors Weiguang Peng

Publication date 25 August 2023

Published in Computability Theory and Foundations of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789811259296_0004

zbMATH Keywords

computational complexityanalysis of algorithmsgame treesindependent distribution

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

This page was built for publication: A Survey of the Distributional Complexity for AND-OR Trees

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