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

Structural average case complexity

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

DOI10.1006/jcss.1996.0024zbMath0855.68042OpenAlexW2048783513MaRDI QIDQ1916530

Rainer Schuler, Tomoyuki Yamakami

Publication date: 27 January 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/01da7e4e2efbfe77e8587a7f47bb8dbed63b4e23


zbMATH Keywords

average-case complexity measurepolynomial on average


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)


Related Items (3)

Average-case intractability vs. worst-case intractability ⋮ Sets computable in polynomial time on average ⋮ Polynomial time samplable distributions




This page was built for publication: Structural average case complexity

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