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

On Some Complexity Characteristics of Immune Sets

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

DOI10.1002/MALQ.19950410303zbMath0827.03024OpenAlexW2089777076MaRDI QIDQ4844506

V. K. Bulitko

Publication date: 27 August 1995

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19950410303


zbMATH Keywords

Kolmogorov complexitycomplete setcompleteness criterionhyperhypersimple setsimple setsmaximal setshypersimple set


Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25)








This page was built for publication: On Some Complexity Characteristics of Immune Sets

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