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

On the computational complexity of the maximum trade problem

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

DOI10.1007/BF02016333zbMath0939.68651OpenAlexW2317421154MaRDI QIDQ1891433

Zhi-Quan Luo, David Lorge Parnas

Publication date: 6 July 2000

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02016333



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trade models (91B60)




Cites Work

  • Unnamed Item


This page was built for publication: On the computational complexity of the maximum trade problem

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