On the construction of irredundant coverings of an integer matrix
Abstract New estimates are derived for the computational complexity of the problem of constructing irredundant coverings of an integer matrix (search for maximal conjunctions of a special logical function).
Gespeichert in:
| Autor*in: |
Dem’yanov, E. A. [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2007 |
|---|
| Schlagwörter: |
discrete recognition and classification procedures irredundant covering of an integer matrix asymptotically optimal algorithm |
|---|
| Anmerkung: |
© Pleiades Publishing, Ltd. 2007 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Computational mathematics and mathematical physics - Nauka/Interperiodica, 1992, 47(2007), 3 vom: März, Seite 518-526 |
|---|---|
| Übergeordnetes Werk: |
volume:47 ; year:2007 ; number:3 ; month:03 ; pages:518-526 |
| Links: |
|---|
| DOI / URN: |
10.1134/S0965542507030141 |
|---|
| Katalog-ID: |
OLC203734208X |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC203734208X | ||
| 003 | DE-627 | ||
| 005 | 20230504115439.0 | ||
| 007 | tu | ||
| 008 | 200820s2007 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1134/S0965542507030141 |2 doi | |
| 035 | |a (DE-627)OLC203734208X | ||
| 035 | |a (DE-He213)S0965542507030141-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |q VZ |
| 100 | 1 | |a Dem’yanov, E. A. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a On the construction of irredundant coverings of an integer matrix |
| 264 | 1 | |c 2007 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Pleiades Publishing, Ltd. 2007 | ||
| 520 | |a Abstract New estimates are derived for the computational complexity of the problem of constructing irredundant coverings of an integer matrix (search for maximal conjunctions of a special logical function). | ||
| 650 | 4 | |a discrete recognition and classification procedures | |
| 650 | 4 | |a irredundant covering of an integer matrix | |
| 650 | 4 | |a asymptotically optimal algorithm | |
| 650 | 4 | |a metric properties of a set of coverings | |
| 650 | 4 | |a metric properties of disjunctive normal forms | |
| 700 | 1 | |a Djukova, E. V. |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Computational mathematics and mathematical physics |d Nauka/Interperiodica, 1992 |g 47(2007), 3 vom: März, Seite 518-526 |w (DE-627)131059181 |w (DE-600)1106328-2 |w (DE-576)029158060 |x 0965-5425 |7 nnns |
| 773 | 1 | 8 | |g volume:47 |g year:2007 |g number:3 |g month:03 |g pages:518-526 |
| 856 | 4 | 1 | |u https://doi.org/10.1134/S0965542507030141 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_4311 | ||
| 951 | |a AR | ||
| 952 | |d 47 |j 2007 |e 3 |c 03 |h 518-526 | ||
| author_variant |
e a d ea ead e v d ev evd |
|---|---|
| matchkey_str |
article:09655425:2007----::nhcntutooirdnatoeigoa |
| hierarchy_sort_str |
2007 |
| publishDate |
2007 |
| allfields |
10.1134/S0965542507030141 doi (DE-627)OLC203734208X (DE-He213)S0965542507030141-p DE-627 ger DE-627 rakwb eng 510 VZ Dem’yanov, E. A. verfasserin aut On the construction of irredundant coverings of an integer matrix 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Pleiades Publishing, Ltd. 2007 Abstract New estimates are derived for the computational complexity of the problem of constructing irredundant coverings of an integer matrix (search for maximal conjunctions of a special logical function). discrete recognition and classification procedures irredundant covering of an integer matrix asymptotically optimal algorithm metric properties of a set of coverings metric properties of disjunctive normal forms Djukova, E. V. aut Enthalten in Computational mathematics and mathematical physics Nauka/Interperiodica, 1992 47(2007), 3 vom: März, Seite 518-526 (DE-627)131059181 (DE-600)1106328-2 (DE-576)029158060 0965-5425 nnns volume:47 year:2007 number:3 month:03 pages:518-526 https://doi.org/10.1134/S0965542507030141 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_4311 AR 47 2007 3 03 518-526 |
| spelling |
10.1134/S0965542507030141 doi (DE-627)OLC203734208X (DE-He213)S0965542507030141-p DE-627 ger DE-627 rakwb eng 510 VZ Dem’yanov, E. A. verfasserin aut On the construction of irredundant coverings of an integer matrix 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Pleiades Publishing, Ltd. 2007 Abstract New estimates are derived for the computational complexity of the problem of constructing irredundant coverings of an integer matrix (search for maximal conjunctions of a special logical function). discrete recognition and classification procedures irredundant covering of an integer matrix asymptotically optimal algorithm metric properties of a set of coverings metric properties of disjunctive normal forms Djukova, E. V. aut Enthalten in Computational mathematics and mathematical physics Nauka/Interperiodica, 1992 47(2007), 3 vom: März, Seite 518-526 (DE-627)131059181 (DE-600)1106328-2 (DE-576)029158060 0965-5425 nnns volume:47 year:2007 number:3 month:03 pages:518-526 https://doi.org/10.1134/S0965542507030141 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_4311 AR 47 2007 3 03 518-526 |
| allfields_unstemmed |
10.1134/S0965542507030141 doi (DE-627)OLC203734208X (DE-He213)S0965542507030141-p DE-627 ger DE-627 rakwb eng 510 VZ Dem’yanov, E. A. verfasserin aut On the construction of irredundant coverings of an integer matrix 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Pleiades Publishing, Ltd. 2007 Abstract New estimates are derived for the computational complexity of the problem of constructing irredundant coverings of an integer matrix (search for maximal conjunctions of a special logical function). discrete recognition and classification procedures irredundant covering of an integer matrix asymptotically optimal algorithm metric properties of a set of coverings metric properties of disjunctive normal forms Djukova, E. V. aut Enthalten in Computational mathematics and mathematical physics Nauka/Interperiodica, 1992 47(2007), 3 vom: März, Seite 518-526 (DE-627)131059181 (DE-600)1106328-2 (DE-576)029158060 0965-5425 nnns volume:47 year:2007 number:3 month:03 pages:518-526 https://doi.org/10.1134/S0965542507030141 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_4311 AR 47 2007 3 03 518-526 |
| allfieldsGer |
10.1134/S0965542507030141 doi (DE-627)OLC203734208X (DE-He213)S0965542507030141-p DE-627 ger DE-627 rakwb eng 510 VZ Dem’yanov, E. A. verfasserin aut On the construction of irredundant coverings of an integer matrix 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Pleiades Publishing, Ltd. 2007 Abstract New estimates are derived for the computational complexity of the problem of constructing irredundant coverings of an integer matrix (search for maximal conjunctions of a special logical function). discrete recognition and classification procedures irredundant covering of an integer matrix asymptotically optimal algorithm metric properties of a set of coverings metric properties of disjunctive normal forms Djukova, E. V. aut Enthalten in Computational mathematics and mathematical physics Nauka/Interperiodica, 1992 47(2007), 3 vom: März, Seite 518-526 (DE-627)131059181 (DE-600)1106328-2 (DE-576)029158060 0965-5425 nnns volume:47 year:2007 number:3 month:03 pages:518-526 https://doi.org/10.1134/S0965542507030141 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_4311 AR 47 2007 3 03 518-526 |
| allfieldsSound |
10.1134/S0965542507030141 doi (DE-627)OLC203734208X (DE-He213)S0965542507030141-p DE-627 ger DE-627 rakwb eng 510 VZ Dem’yanov, E. A. verfasserin aut On the construction of irredundant coverings of an integer matrix 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Pleiades Publishing, Ltd. 2007 Abstract New estimates are derived for the computational complexity of the problem of constructing irredundant coverings of an integer matrix (search for maximal conjunctions of a special logical function). discrete recognition and classification procedures irredundant covering of an integer matrix asymptotically optimal algorithm metric properties of a set of coverings metric properties of disjunctive normal forms Djukova, E. V. aut Enthalten in Computational mathematics and mathematical physics Nauka/Interperiodica, 1992 47(2007), 3 vom: März, Seite 518-526 (DE-627)131059181 (DE-600)1106328-2 (DE-576)029158060 0965-5425 nnns volume:47 year:2007 number:3 month:03 pages:518-526 https://doi.org/10.1134/S0965542507030141 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_4311 AR 47 2007 3 03 518-526 |
| language |
English |
| source |
Enthalten in Computational mathematics and mathematical physics 47(2007), 3 vom: März, Seite 518-526 volume:47 year:2007 number:3 month:03 pages:518-526 |
| sourceStr |
Enthalten in Computational mathematics and mathematical physics 47(2007), 3 vom: März, Seite 518-526 volume:47 year:2007 number:3 month:03 pages:518-526 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
discrete recognition and classification procedures irredundant covering of an integer matrix asymptotically optimal algorithm metric properties of a set of coverings metric properties of disjunctive normal forms |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Computational mathematics and mathematical physics |
| authorswithroles_txt_mv |
Dem’yanov, E. A. @@aut@@ Djukova, E. V. @@aut@@ |
| publishDateDaySort_date |
2007-03-01T00:00:00Z |
| hierarchy_top_id |
131059181 |
| dewey-sort |
3510 |
| id |
OLC203734208X |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC203734208X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504115439.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2007 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1134/S0965542507030141</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC203734208X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)S0965542507030141-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dem’yanov, E. A.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the construction of irredundant coverings of an integer matrix</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2007</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Pleiades Publishing, Ltd. 2007</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract New estimates are derived for the computational complexity of the problem of constructing irredundant coverings of an integer matrix (search for maximal conjunctions of a special logical function).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">discrete recognition and classification procedures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">irredundant covering of an integer matrix</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">asymptotically optimal algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">metric properties of a set of coverings</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">metric properties of disjunctive normal forms</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Djukova, E. V.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Computational mathematics and mathematical physics</subfield><subfield code="d">Nauka/Interperiodica, 1992</subfield><subfield code="g">47(2007), 3 vom: März, Seite 518-526</subfield><subfield code="w">(DE-627)131059181</subfield><subfield code="w">(DE-600)1106328-2</subfield><subfield code="w">(DE-576)029158060</subfield><subfield code="x">0965-5425</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:47</subfield><subfield code="g">year:2007</subfield><subfield code="g">number:3</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:518-526</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1134/S0965542507030141</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4311</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">47</subfield><subfield code="j">2007</subfield><subfield code="e">3</subfield><subfield code="c">03</subfield><subfield code="h">518-526</subfield></datafield></record></collection>
|
| author |
Dem’yanov, E. A. |
| spellingShingle |
Dem’yanov, E. A. ddc 510 misc discrete recognition and classification procedures misc irredundant covering of an integer matrix misc asymptotically optimal algorithm misc metric properties of a set of coverings misc metric properties of disjunctive normal forms On the construction of irredundant coverings of an integer matrix |
| authorStr |
Dem’yanov, E. A. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)131059181 |
| format |
Article |
| dewey-ones |
510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0965-5425 |
| topic_title |
510 VZ On the construction of irredundant coverings of an integer matrix discrete recognition and classification procedures irredundant covering of an integer matrix asymptotically optimal algorithm metric properties of a set of coverings metric properties of disjunctive normal forms |
| topic |
ddc 510 misc discrete recognition and classification procedures misc irredundant covering of an integer matrix misc asymptotically optimal algorithm misc metric properties of a set of coverings misc metric properties of disjunctive normal forms |
| topic_unstemmed |
ddc 510 misc discrete recognition and classification procedures misc irredundant covering of an integer matrix misc asymptotically optimal algorithm misc metric properties of a set of coverings misc metric properties of disjunctive normal forms |
| topic_browse |
ddc 510 misc discrete recognition and classification procedures misc irredundant covering of an integer matrix misc asymptotically optimal algorithm misc metric properties of a set of coverings misc metric properties of disjunctive normal forms |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Computational mathematics and mathematical physics |
| hierarchy_parent_id |
131059181 |
| dewey-tens |
510 - Mathematics |
| hierarchy_top_title |
Computational mathematics and mathematical physics |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)131059181 (DE-600)1106328-2 (DE-576)029158060 |
| title |
On the construction of irredundant coverings of an integer matrix |
| ctrlnum |
(DE-627)OLC203734208X (DE-He213)S0965542507030141-p |
| title_full |
On the construction of irredundant coverings of an integer matrix |
| author_sort |
Dem’yanov, E. A. |
| journal |
Computational mathematics and mathematical physics |
| journalStr |
Computational mathematics and mathematical physics |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2007 |
| contenttype_str_mv |
txt |
| container_start_page |
518 |
| author_browse |
Dem’yanov, E. A. Djukova, E. V. |
| container_volume |
47 |
| class |
510 VZ |
| format_se |
Aufsätze |
| author-letter |
Dem’yanov, E. A. |
| doi_str_mv |
10.1134/S0965542507030141 |
| dewey-full |
510 |
| title_sort |
on the construction of irredundant coverings of an integer matrix |
| title_auth |
On the construction of irredundant coverings of an integer matrix |
| abstract |
Abstract New estimates are derived for the computational complexity of the problem of constructing irredundant coverings of an integer matrix (search for maximal conjunctions of a special logical function). © Pleiades Publishing, Ltd. 2007 |
| abstractGer |
Abstract New estimates are derived for the computational complexity of the problem of constructing irredundant coverings of an integer matrix (search for maximal conjunctions of a special logical function). © Pleiades Publishing, Ltd. 2007 |
| abstract_unstemmed |
Abstract New estimates are derived for the computational complexity of the problem of constructing irredundant coverings of an integer matrix (search for maximal conjunctions of a special logical function). © Pleiades Publishing, Ltd. 2007 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_4311 |
| container_issue |
3 |
| title_short |
On the construction of irredundant coverings of an integer matrix |
| url |
https://doi.org/10.1134/S0965542507030141 |
| remote_bool |
false |
| author2 |
Djukova, E. V. |
| author2Str |
Djukova, E. V. |
| ppnlink |
131059181 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1134/S0965542507030141 |
| up_date |
2024-07-03T14:47:27.523Z |
| _version_ |
1803569644199477248 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC203734208X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504115439.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2007 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1134/S0965542507030141</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC203734208X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)S0965542507030141-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dem’yanov, E. A.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the construction of irredundant coverings of an integer matrix</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2007</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Pleiades Publishing, Ltd. 2007</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract New estimates are derived for the computational complexity of the problem of constructing irredundant coverings of an integer matrix (search for maximal conjunctions of a special logical function).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">discrete recognition and classification procedures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">irredundant covering of an integer matrix</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">asymptotically optimal algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">metric properties of a set of coverings</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">metric properties of disjunctive normal forms</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Djukova, E. V.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Computational mathematics and mathematical physics</subfield><subfield code="d">Nauka/Interperiodica, 1992</subfield><subfield code="g">47(2007), 3 vom: März, Seite 518-526</subfield><subfield code="w">(DE-627)131059181</subfield><subfield code="w">(DE-600)1106328-2</subfield><subfield code="w">(DE-576)029158060</subfield><subfield code="x">0965-5425</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:47</subfield><subfield code="g">year:2007</subfield><subfield code="g">number:3</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:518-526</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1134/S0965542507030141</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4311</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">47</subfield><subfield code="j">2007</subfield><subfield code="e">3</subfield><subfield code="c">03</subfield><subfield code="h">518-526</subfield></datafield></record></collection>
|
| score |
7.3999653 |