Rough analysis of computation trees
From MaRDI portal
Publication:2172394
DOI10.1016/j.dam.2022.06.032OpenAlexW4283769296MaRDI QIDQ2172394
Publication date: 15 September 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.00311
Artificial intelligence (68Txx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- On topological lower bounds for algebraic computation trees
- Algebraic decision trees and Euler characteristics
- A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem
- On the complexity of computations under varying sets of primitives
- Complexity lower bounds for computation trees with elementary transcendental function gates
- A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem
- Lower bounds for algebraic decision trees
- Multidimensional Searching Problems
- Transactions on Rough Sets III
- Decision tree complexity and Betti numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Rough analysis of computation trees
