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

Complexity of certain systems of monomials in calculation by composition circuits

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

DOI10.3103/S0027132214050039zbMath1344.68304MaRDI QIDQ2018044

E. N. Trusevich

Publication date: 24 March 2015

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



Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Discrete mathematics in relation to computer science (68R99)


Related Items (1)

On the complexity of implementation of a system of two monomials by composition circuits



Cites Work

  • Relation between two measures of the computation complexity for systems of monomials
  • On the complexity of computation of a pair of monomials in two variables
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Complexity of certain systems of monomials in calculation by composition circuits

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