Approximating Minimum Representations of Key Horn Functions

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on computing 2022-02, Vol.51 (1), p.116-138
Hauptverfasser:	Bérczi, Kristóf, Boros, Endre, Čepek, Ondřej, Kučera, Petr, Makino, Kazuhisa
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	138
container_issue	1
container_start_page	116
container_title	SIAM journal on computing
container_volume	51
creator	Bérczi, Kristóf Boros, Endre Čepek, Ondřej Kučera, Petr Makino, Kazuhisa
description
doi_str_mv	10.1137/19M1275681
format	Article
fullrecord	<record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1137_19M1275681</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1137_19M1275681</sourcerecordid><originalsourceid>FETCH-LOGICAL-c297t-d1febae8526ee45fbb13cf14cf190dc74efdb736faa84ad348810d698814beee3</originalsourceid><addsrcrecordid>eNpFj01LxDAURYMoWEc3_oKshWhekzQJrobBccQZBNF1SZsXqdi0JB1w_r31A1xcDtzF5R5CLoFfAwh9A3YHpVaVgSNSALeKaQA4JgXnVjMlrD4lZzm_cw5SgijI7XIc0_DZ9W7q4hvddbHr9z19xjFhxjjN9RAzHQJ9xAPdDCnS9T62P-05OQnuI-PFHxfkdX33stqw7dP9w2q5ZW1p9cQ8BGwcGlVWiFKFpgHRBpBzLPetlhh8o0UVnDPSeSGNAe4rO0M2iCgW5Op3t01DzglDPab5cDrUwOtv7fpfW3wBtJNLUA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Approximating Minimum Representations of Key Horn Functions</title><source>SIAM Journals Online</source><creator>Bérczi, Kristóf ; Boros, Endre ; Čepek, Ondřej ; Kučera, Petr ; Makino, Kazuhisa</creator><creatorcontrib>Bérczi, Kristóf ; Boros, Endre ; Čepek, Ondřej ; Kučera, Petr ; Makino, Kazuhisa</creatorcontrib><identifier>ISSN: 0097-5397</identifier><identifier>EISSN: 1095-7111</identifier><identifier>DOI: 10.1137/19M1275681</identifier><language>eng</language><ispartof>SIAM journal on computing, 2022-02, Vol.51 (1), p.116-138</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c297t-d1febae8526ee45fbb13cf14cf190dc74efdb736faa84ad348810d698814beee3</citedby><cites>FETCH-LOGICAL-c297t-d1febae8526ee45fbb13cf14cf190dc74efdb736faa84ad348810d698814beee3</cites><orcidid>0000-0002-7512-6260</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,781,785,3185,27929,27930</link.rule.ids></links><search><creatorcontrib>Bérczi, Kristóf</creatorcontrib><creatorcontrib>Boros, Endre</creatorcontrib><creatorcontrib>Čepek, Ondřej</creatorcontrib><creatorcontrib>Kučera, Petr</creatorcontrib><creatorcontrib>Makino, Kazuhisa</creatorcontrib><title>Approximating Minimum Representations of Key Horn Functions</title><title>SIAM journal on computing</title><issn>0097-5397</issn><issn>1095-7111</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNpFj01LxDAURYMoWEc3_oKshWhekzQJrobBccQZBNF1SZsXqdi0JB1w_r31A1xcDtzF5R5CLoFfAwh9A3YHpVaVgSNSALeKaQA4JgXnVjMlrD4lZzm_cw5SgijI7XIc0_DZ9W7q4hvddbHr9z19xjFhxjjN9RAzHQJ9xAPdDCnS9T62P-05OQnuI-PFHxfkdX33stqw7dP9w2q5ZW1p9cQ8BGwcGlVWiFKFpgHRBpBzLPetlhh8o0UVnDPSeSGNAe4rO0M2iCgW5Op3t01DzglDPab5cDrUwOtv7fpfW3wBtJNLUA</recordid><startdate>202202</startdate><enddate>202202</enddate><creator>Bérczi, Kristóf</creator><creator>Boros, Endre</creator><creator>Čepek, Ondřej</creator><creator>Kučera, Petr</creator><creator>Makino, Kazuhisa</creator><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-7512-6260</orcidid></search><sort><creationdate>202202</creationdate><title>Approximating Minimum Representations of Key Horn Functions</title><author>Bérczi, Kristóf ; Boros, Endre ; Čepek, Ondřej ; Kučera, Petr ; Makino, Kazuhisa</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c297t-d1febae8526ee45fbb13cf14cf190dc74efdb736faa84ad348810d698814beee3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bérczi, Kristóf</creatorcontrib><creatorcontrib>Boros, Endre</creatorcontrib><creatorcontrib>Čepek, Ondřej</creatorcontrib><creatorcontrib>Kučera, Petr</creatorcontrib><creatorcontrib>Makino, Kazuhisa</creatorcontrib><collection>CrossRef</collection><jtitle>SIAM journal on computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bérczi, Kristóf</au><au>Boros, Endre</au><au>Čepek, Ondřej</au><au>Kučera, Petr</au><au>Makino, Kazuhisa</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Approximating Minimum Representations of Key Horn Functions</atitle><jtitle>SIAM journal on computing</jtitle><date>2022-02</date><risdate>2022</risdate><volume>51</volume><issue>1</issue><spage>116</spage><epage>138</epage><pages>116-138</pages><issn>0097-5397</issn><eissn>1095-7111</eissn><doi>10.1137/19M1275681</doi><tpages>23</tpages><orcidid>https://orcid.org/0000-0002-7512-6260</orcidid></addata></record>
fulltext	fulltext
identifier	ISSN: 0097-5397
ispartof	SIAM journal on computing, 2022-02, Vol.51 (1), p.116-138
issn	0097-5397 1095-7111
language	eng
recordid	cdi_crossref_primary_10_1137_19M1275681
source	SIAM Journals Online
title	Approximating Minimum Representations of Key Horn Functions
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-12T04%3A51%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Approximating%20Minimum%20Representations%20of%20Key%20Horn%20Functions&rft.jtitle=SIAM%20journal%20on%20computing&rft.au=B%C3%A9rczi,%20Krist%C3%B3f&rft.date=2022-02&rft.volume=51&rft.issue=1&rft.spage=116&rft.epage=138&rft.pages=116-138&rft.issn=0097-5397&rft.eissn=1095-7111&rft_id=info:doi/10.1137/19M1275681&rft_dat=%3Ccrossref%3E10_1137_19M1275681%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true