We are working to restore the Unionpedia app on the Google Play Store
OutgoingIncoming
🌟We've simplified our design for better navigation!
Instagram Facebook X LinkedIn
Your own Unionpedia with your logo and domain, from 9.99 USD/month
Create my Unionpedia

Pagh's problem

Index Pagh's problem

Pagh's problem is a datastructure problem often used when studying lower bounds in computer science named after Rasmus Pagh. [1]

Table of Contents

  1. 2 relations: Online matrix-vector multiplication problem, Rasmus Pagh.

Online matrix-vector multiplication problem

In computational complexity theory, the online matrix-vector multiplication problem (OMv) asks an online algorithm to return, at each round, the product of an n\times n matrix and a newly-arrived n-dimensional vector.

See Pagh's problem and Online matrix-vector multiplication problem

Rasmus Pagh

Rasmus Pagh is a Danish computer scientist and a professor of computer science at the University of Copenhagen.

See Pagh's problem and Rasmus Pagh

References

[1] https://en.wikipedia.org/wiki/Pagh's_problem