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 complexity of the computation of certain classes of polynomials of several variables

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

zbMath0658.68048MaRDI QIDQ1111380

Sergey B. Gashkov

Publication date: 1988

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)


zbMATH Keywords

complexity of computationpolynomials of several variables


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to field theory (12-04)


Related Items (1)

Representation of monomials as a sum of powers of linear forms







This page was built for publication: On the complexity of the computation of certain classes of polynomials of several variables

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