Tree models and probabilistic polynomial time computations

MaRDI QIDQ4953368zbMATH OpenFDO

Authors Aris Pagourtzis, Kiron Sharma, Evangelie Zachos

Publication date 9 May 2000

zbMATH Keywords

binary tree modelprobabilistic Turing machines

Mathematics Subject Classification ID

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

Recommendations

• Generalised and quotient models for random and/or~trees and application to satisfiability
• scientific article; zbMATH DE number 4104976
• Validation of Stochastic Systems
• Algorithms, random tree models and combinatorial objects
• The complexity of problems on probabilistic, nondeterministic, and alternating decision trees
• A probabilistic analysis of some tree algorithms
• Random Trees and the Analysis of Branch and Bound Procedures
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Simulating probabilistic by deterministic algebraic computation trees
• Probabilistic parameterized polynomial time

Cited in

(6)

• Polynomial-time versus recursive models
• Simulating probabilistic by deterministic algebraic computation trees
• A sprouting tree model for random boolean functions
• Complexity of Hierarchical Trees in Evidence Theory
• Stathis Zachos at 70!
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty

This page was built for publication: Tree models and probabilistic polynomial time computations

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