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 discrete generation problems

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

DOI10.1134/S1064562410060025zbMath1215.68110MaRDI QIDQ542310

R. M. Sotnezov, E. V. Dyukova

Publication date: 8 June 2011

Published in: Doklady Mathematics (Search for Journal in Brave)



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean and Hadamard matrices (15B34)


Related Items (2)

On the complexity of the dualization problem ⋮ Asymptotically optimal dualization algorithms






This page was built for publication: On the complexity of discrete generation problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:542310&oldid=12429660"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 06:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki