A Survey of the Distributional Complexity for AND-OR Trees

From MaRDI portal

Publication:6135563

Jump to:navigation, search

DOI10.1142/9789811259296_0004OpenAlexW4283012482MaRDI QIDQ6135563FDOQ6135563

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 complexity analysis of algorithms game trees independent 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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6135563&oldid=35594179"