scientific article; zbMATH DE number 3854414

zbMATH Open0537.68041MaRDI QIDQ3323262FDOQ3323262

Authors: Jerzy W. Jaromczyk 

Publication date: 1983

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3976336
• Applications of Ramsey's theorem to decision tree complexity
• Decision trees: Old and new results.
• Lower bounds on probabilistic linear decision trees
• Decision trees with Boolean threshold queries

zbMATH Keywords

lower boundsteststime complexitycounting argumentdecision tree algorithmspolynomial decision trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited In (4)

• On certain computable tests and componentwise error bounds
• Study of the bounds on the number of basic sets in a test.
• Complexity bounds for zero-test algorithms
• Bounds on the size of test sets for sorting and related networks

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 Q3323262)