scientific article
From MaRDI portal
Publication:3919074
zbMath0466.68030MaRDI QIDQ3919074
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items (7)
Jump interpolation search trees and symmetric binary numbers ⋮ Average complexity of divide-and-conquer algorithms ⋮ The degree/diameter problem for mixed abelian Cayley graphs ⋮ The maximum degree and diameter-bounded subgraph in the mesh ⋮ A switch convergence for a small perturbation of a linear recurrence equation ⋮ Riordan matrices and higher-dimensional lattice walks ⋮ On binary tree encodements
This page was built for publication:
