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

scientific article; zbMATH DE number 3609171

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

zbMATH Open0392.68077MaRDI QIDQ4174271FDOQ4174271

E. V. Dyukova

Publication date: 1978



Title of this publication is not available (Why is that?)


zbMATH Keywords

computational complexitypattern recognitionirredundant teststest algorithmsk-valued tables


Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)




   Recommendations
  • An algorithm for constructing irredundant tests for binary tables πŸ‘ πŸ‘Ž
  • Irredundant test for binary tables πŸ‘ πŸ‘Ž
  • On complete conditional tests for tables with separated blocks of ones πŸ‘ πŸ‘Ž
  • On some testing problems for sparse contingency tables. πŸ‘ πŸ‘Ž
  • Title not available (Why is that?) πŸ‘ πŸ‘Ž
  • Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing πŸ‘ πŸ‘Ž
  • Greedy Algorithms for Construction of Approximate Tests for Decision Tables with Many-Valued Decisions πŸ‘ πŸ‘Ž





This page was built for publication:

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

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