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

On relationships between approximate and probabilistic complexity classes

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

zbMath0806.68047MaRDI QIDQ1326985

Guangyuan Li, Li Xiang

Publication date: 15 June 1994

Published in: Science in China. Series A (Search for Journal in Brave)


zbMATH Keywords

exponential-time approximation algorithms


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)








This page was built for publication: On relationships between approximate and probabilistic complexity classes

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