Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On the complexity of sorting problem for a Boolean algebra

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

DOI10.1515/DMA.1992.2.3.313zbMATH Open0825.68407OpenAlexW2054805500MaRDI QIDQ4713752FDOQ4713752


Authors: V. V. Morozenko Edit this on Wikidata


Publication date: 25 June 1992

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

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





zbMATH Keywords

complexityBoolean algebra


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Logical aspects of Boolean algebras (03G05)







This page was built for publication: On the complexity of sorting problem for a Boolean algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4713752)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4713752&oldid=11999030"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 29 January 2024, at 23:22. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki