English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter

MPS-Authors
/persons/resource/persons45571

Subramanian,  C. R.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Schnorr, C. P., & Subramanian, C. R. (1998). Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter. In M. Luby, J. Rolim, & M. Serna (Eds.), Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98) (pp. 218-231). Berlin, Germany: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-3750-A
Abstract
There is no abstract available