Theoretical analysis of git bisect

DOI10.1007/978-3-031-20624-5_10OpenAlexW4285685859MaRDI QIDQ6109002

No author found.

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

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

Cites Work

• Searching in random partially ordered sets
• On the complexity of searching in trees and partially ordered structures
• Constructing optimal binary decision trees is NP-complete
• On the hardness of the minimum height decision tree problem
• Approximating optimal binary decision trees
• Optimal Search in Trees
• Decision Trees for Geometric Models
• Deterministic and probabilistic binary search in graphs
• Unnamed Item
• Unnamed Item

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