Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3974291

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

zbMATH Open0603.68042MaRDI QIDQ3740232FDOQ3740232


Authors: E. V. Krishnamurthy Edit this on Wikidata


Publication date: 1986



Title of this publication is not available (Why is that?)



Recommendations

  • scientific article
  • Publication:4203821
  • An overview of computational complexity
  • scientific article; zbMATH DE number 3936510
  • scientific article; zbMATH DE number 4030991


zbMATH Keywords

surveyrandom algorithmsefficiency of probabilistic algorithms


Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)



Cited In (3)

  • Title not available (Why is that?)
  • On producing multiple solutions using repeated trials
  • Title not available (Why is that?)





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740232)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3740232&oldid=17261177"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 10:48. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki