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

Bounding the complexity of advice functions

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

DOI10.1006/JCSS.1995.1037zbMath0837.68032OpenAlexW2177933803MaRDI QIDQ1894454

Ricard Gavaldà

Publication date: 24 July 1995

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

Full work available at URL: https://doi.org/10.1006/jcss.1995.1037


zbMATH Keywords

complexity theoryadvice function


Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)


Related Items (1)

Average-case intractability vs. worst-case intractability







This page was built for publication: Bounding the complexity of advice functions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1894454&oldid=14301972"
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 13:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki