scientific article; zbMATH DE number 3499229

From MaRDI portal

Revision as of 05:43, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4080721

Jump to:navigation, search

zbMath0318.68034MaRDI QIDQ4080721

Richard J. Lipton, David P. Dobkin

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Algorithms in computer science (68W99)

Related Items (7)

Algebraic decision trees and Euler characteristics ⋮ Lower bounds on algebraic random access machines ⋮ Decision tree complexity and Betti numbers ⋮ Finding nearest neighbours ⋮ Some geometric lower bounds ⋮ Lower bounds on the worst-case complexity of some oracle algorithms ⋮ On the time-space tradeoff for sorting with linear queries

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4080721&oldid=17831122"