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

Parallelizing a new algorithm for the set partition problem

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

DOI10.2478/V10065-010-0049-1zbMath1284.68641OpenAlexW2021655253MaRDI QIDQ2442932

Hoang Thanh

Publication date: 2 April 2014

Published in: Annales Universitatis Mariae Curie-Skłodowska. Sectio A1. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/v10065-010-0049-1



Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)





Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Parallelizing a new algorithm for the set partition problem

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