The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Friday, July 11 until 2:00 AM ET on Saturday, July 12 due to maintenance. We apologize for the inconvenience.
Explore Research Products in the PAR It may take a few hours for recently added research products to appear in PAR search results.
Papp, Dávid. Polinomiális optimalizálási feladatok és relaxációik. Retrieved from https://par.nsf.gov/biblio/10326037. Alkalmazott Matematikai Lapok 38.1 Web. doi:10.37070/AML.2021.38.1.07.
Papp, Dávid. Polinomiális optimalizálási feladatok és relaxációik. Alkalmazott Matematikai Lapok, 38 (1). Retrieved from https://par.nsf.gov/biblio/10326037. https://doi.org/10.37070/AML.2021.38.1.07
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.