Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:3898031
Jump to:navigation, search

zbMath0451.68038MaRDI QIDQ3898031

Dorothea Haken, James B. Saxe, Jon Louis Bentley

Publication date: 1980


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

zbMATH Keywords

recurrence relationsdivide-and-conquer algorithms


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)


Related Items (11)

Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices ⋮ Synthesis with asymptotic resource bounds ⋮ Average complexity of divide-and-conquer algorithms ⋮ An upper bound for the Menchov-Rademacher operator for right triangles ⋮ Identities and periodic oscillations of divide-and-conquer recurrences splitting at half ⋮ Transitive closure for restricted classes of partial orders ⋮ Fractal geometry, Turing machines and divide-and-conquer recurrences ⋮ A Real Elementary Approach to the Master Recurrence and Generalizations ⋮ A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles ⋮ Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy ⋮ A frame for general divide-and-conquer recurrences






This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3898031&oldid=17543635"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 20:02.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki