scientific article; zbMATH DE number 194559
From MaRDI portal
Publication:4692525
zbMath0717.68005MaRDI QIDQ4692525
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear programmingdynamic programmingNP-complete problemsgeometric algorithmsgraph algorithmspattern matchingcryptologyparsingexhaustive searchstring processingPASCALmathematical algorithms
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Parallel algorithms in computer science (68W10) Data structures (68P05) General topics in the theory of software (68N01)
Related Items (11)
Easing the conscience of the guilty net ⋮ Unnamed Item ⋮ Lower bounds for the matrix chain ordering problem ⋮ Unnamed Item ⋮ Positioning an autonomous off-road vehicle by using fused DGPS and inertial navigation ⋮ Agent-Based Modeling and Computer Languages ⋮ The optimization of an organizational restructuring problem. ⋮ On optimizing multiplications of sparse matrices ⋮ On the Stack-Size of General Tries ⋮ A limit theorem for “quicksort” ⋮ Table design in dynamic programming
Uses Software
This page was built for publication:
