A lower bound for the integer element distinctness problem

DOI10.1016/0890-5401(91)90034-YzbMath0768.68054MaRDI QIDQ1175947

András Rácz, Anna Lubiw

Publication date: 25 June 1992

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

bounded-order algebraic decision tree modelinteger element distinctness problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Algebraic decision trees and Euler characteristics ⋮ Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs

Cites Work

• The Ultimate Planar Convex Hull Algorithm?
• Lower bounds for algebraic decision trees
• On the Betti Numbers of Real Varieties
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A lower bound for the integer element distinctness problem