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 schemes in an infinite basis

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

zbMath0874.94047MaRDI QIDQ1358442

O. M. Kasim-Zade

Publication date: 1 July 1997

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


zbMATH Keywords

complexityBoolean functionsinfinite basis


Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (4)

Complexity of linear and majority functions in the basis of antichain functions ⋮ Circuit complexity of symmetric Boolean functions in antichain basis ⋮ On the Complexity of Multivalued Logic Functions over Some Infinite Basis ⋮ Lower estimates of circuit complexity in the basis of antichain functions




This page was built for publication: On the complexity of schemes in an infinite basis

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1358442&oldid=13497901"
Category:
  • Pages with script errors
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 14:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki