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 implementation of a system of two monomials by composition circuits

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

zbMath1499.68105MaRDI QIDQ2031161

Sergey A. Korneev

Publication date: 8 June 2021

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)


zbMATH Keywords

computational complexitycircuit complexitycircuit of gatescomposition circuitsystem of monomials


Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Networks and circuits as models of computation; circuit complexity (68Q06)




Cites Work

  • Complexity of certain systems of monomials in calculation by composition circuits
  • Relation between two measures of the computation complexity for systems of monomials
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2031161&oldid=14507771"
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 20:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki