Theoretical analysis of git bisect

DOI10.1007/978-3-031-20624-5_10MaRDI QIDQ6109002zbMATH OpenOpenAlexFDO

Authors

Publication date 26 July 2023

Published in LATIN 2022: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-20624-5_10

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• Approximating optimal binary decision trees
• Approximation strategies for generalized binary search in weighted trees
• Constructing optimal binary decision trees is NP-complete
• Decision Trees for Geometric Models
• Deterministic and probabilistic binary search in graphs
• scientific article; zbMATH DE number 5764837 (Why is no real title available?)
• On the complexity of searching in trees and partially ordered structures
• On the hardness of the minimum height decision tree problem
• Optimal Search in Trees
• Searching in random partially ordered sets

This page was built for publication: Theoretical analysis of git bisect

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