Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

On the complexity of narrow systems of Boolean vectors

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

DOI10.1515/DMA.1999.9.4.437zbMath0964.94034OpenAlexW1998951984MaRDI QIDQ4522831

A. V. Chashkin

Publication date: 14 May 2001

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

Full work available at URL: https://doi.org/10.1515/dma.1999.9.4.437


zbMATH Keywords

complexityBoolean matrix


Mathematics Subject Classification ID

Boolean functions (06E30)








This page was built for publication: On the complexity of narrow systems of Boolean vectors

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4522831&oldid=29994434"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 6 March 2024, at 21:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki