A polynomial time algorithm to solve the covering problem for 1-bounded conflict-free Petri nets:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Hildesheim
Inst. für Informatik
1991
|
| Schriftenreihe: | Hildesheimer Informatik-Berichte
1991,9 |
| Beschreibung: | 9 Bl. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV005401751 | ||
| 003 | DE-604 | ||
| 005 | 19920708 | ||
| 007 | t | ||
| 008 | 920526s1991 gw d||| |||| 00||| ger d | ||
| 035 | |a (OCoLC)75253978 | ||
| 035 | |a (DE-599)BVBBV005401751 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 |a DE-20 |a DE-29T | ||
| 084 | |a SS 4615 |0 (DE-625)143489: |2 rvk | ||
| 100 | 1 | |a Esparza, Javier |d 1964- |e Verfasser |0 (DE-588)111831016 |4 aut | |
| 245 | 1 | 0 | |a A polynomial time algorithm to solve the covering problem for 1-bounded conflict-free Petri nets |c Javier Esparza |
| 264 | 1 | |a Hildesheim |b Inst. für Informatik |c 1991 | |
| 300 | |a 9 Bl. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Hildesheimer Informatik-Berichte |v 1991,9 | |
| 830 | 0 | |a Hildesheimer Informatik-Berichte |v 1991,9 |w (DE-604)BV002483135 |9 1991,9 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-003381543 | ||
Datensatz im Suchindex
| _version_ | 1804119614358028288 |
|---|---|
| any_adam_object | |
| author | Esparza, Javier 1964- |
| author_GND | (DE-588)111831016 |
| author_facet | Esparza, Javier 1964- |
| author_role | aut |
| author_sort | Esparza, Javier 1964- |
| author_variant | j e je |
| building | Verbundindex |
| bvnumber | BV005401751 |
| classification_rvk | SS 4615 |
| ctrlnum | (OCoLC)75253978 (DE-599)BVBBV005401751 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00985nam a2200289 cb4500</leader><controlfield tag="001">BV005401751</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19920708 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">920526s1991 gw d||| |||| 00||| ger d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75253978</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV005401751</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 4615</subfield><subfield code="0">(DE-625)143489:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Esparza, Javier</subfield><subfield code="d">1964-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)111831016</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A polynomial time algorithm to solve the covering problem for 1-bounded conflict-free Petri nets</subfield><subfield code="c">Javier Esparza</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hildesheim</subfield><subfield code="b">Inst. für Informatik</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 Bl.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Hildesheimer Informatik-Berichte</subfield><subfield code="v">1991,9</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Hildesheimer Informatik-Berichte</subfield><subfield code="v">1991,9</subfield><subfield code="w">(DE-604)BV002483135</subfield><subfield code="9">1991,9</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003381543</subfield></datafield></record></collection> |
| id | DE-604.BV005401751 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T16:28:59Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003381543 |
| oclc_num | 75253978 |
| open_access_boolean | |
| owner | DE-12 DE-20 DE-29T |
| owner_facet | DE-12 DE-20 DE-29T |
| physical | 9 Bl. graph. Darst. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| publisher | Inst. für Informatik |
| record_format | marc |
| series | Hildesheimer Informatik-Berichte |
| series2 | Hildesheimer Informatik-Berichte |
| spelling | Esparza, Javier 1964- Verfasser (DE-588)111831016 aut A polynomial time algorithm to solve the covering problem for 1-bounded conflict-free Petri nets Javier Esparza Hildesheim Inst. für Informatik 1991 9 Bl. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Hildesheimer Informatik-Berichte 1991,9 Hildesheimer Informatik-Berichte 1991,9 (DE-604)BV002483135 1991,9 |
| spellingShingle | Esparza, Javier 1964- A polynomial time algorithm to solve the covering problem for 1-bounded conflict-free Petri nets Hildesheimer Informatik-Berichte |
| title | A polynomial time algorithm to solve the covering problem for 1-bounded conflict-free Petri nets |
| title_auth | A polynomial time algorithm to solve the covering problem for 1-bounded conflict-free Petri nets |
| title_exact_search | A polynomial time algorithm to solve the covering problem for 1-bounded conflict-free Petri nets |
| title_full | A polynomial time algorithm to solve the covering problem for 1-bounded conflict-free Petri nets Javier Esparza |
| title_fullStr | A polynomial time algorithm to solve the covering problem for 1-bounded conflict-free Petri nets Javier Esparza |
| title_full_unstemmed | A polynomial time algorithm to solve the covering problem for 1-bounded conflict-free Petri nets Javier Esparza |
| title_short | A polynomial time algorithm to solve the covering problem for 1-bounded conflict-free Petri nets |
| title_sort | a polynomial time algorithm to solve the covering problem for 1 bounded conflict free petri nets |
| volume_link | (DE-604)BV002483135 |
| work_keys_str_mv | AT esparzajavier apolynomialtimealgorithmtosolvethecoveringproblemfor1boundedconflictfreepetrinets |