Rough analysis of computation trees (Q2172394)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Rough analysis of computation trees	scientific article

Statements

scholarly article

0 references

Rough analysis of computation trees (English)

0 references

Discrete Applied Mathematics

0 references

publication date

15 September 2022

0 references

full work available at URL

https://arxiv.org/abs/2201.00311

0 references

zbMATH Keywords

structure

0 references

computation tree

0 references

complexity measure

0 references

Mikhail Ju. Moshkov

0 references

MaRDI profile type

MaRDI publication profile

0 references

Multidimensional Searching Problems

0 references

A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem

0 references

On the complexity of computations under varying sets of primitives

0 references

On topological lower bounds for algebraic computation trees

0 references

Complexity lower bounds for computation trees with elementary transcendental function gates

0 references

A Polynomial Linear Search Algorithm for the <i>n</i> -Dimensional Knapsack Problem

0 references

0 references

0 references

0 references

0 references

0 references

Transactions on Rough Sets III

0 references

0 references

Lower bounds for algebraic decision trees

0 references

Algebraic decision trees and Euler characteristics

0 references

Decision tree complexity and Betti numbers

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.DAM.2022.06.032

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2172394

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2172394&oldid=38921740"