The complexity of matrix rank and feasible systems of linear equations
Gespeichert in:
| Veröffentlicht in: | Computational complexity 1999-01, Vol.8 (2), p.99-126 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 126 |
|---|---|
| container_issue | 2 |
| container_start_page | 99 |
| container_title | Computational complexity |
| container_volume | 8 |
| creator | Allender, E. Beals, R. Ogihara, M. |
| description | |
| doi_str_mv | 10.1007/s000370050023 |
| format | Article |
| fullrecord | <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1007_s000370050023</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1007_s000370050023</sourcerecordid><originalsourceid>FETCH-LOGICAL-c235t-e530e6e420e22441dc219632f6dc500051cc0c58ad4d5e2c944547d7ef8fd0663</originalsourceid><addsrcrecordid>eNpVkEtLAzEUhYMoWKtL9_kD0ZvnzCylWBUKbup6iMkNRudRc0fo_HtbdNPVOYvD4eNj7FbCnQSo7gkAdAVgAZQ-YwtpFIi6seb80EE6obWqL9kV0SeAtLU2C7befiAPY7_rcJ-nmY-J934qec-LH764HyJP6Cm_d8hppgl7Om66PKAvHL9__JTHga7ZRfId4c1_Ltnb-nG7ehab16eX1cNGBKXtJNBqQIcHLlTKGBmDko3TKrkYDtRgZQgQbO2jiRZVaIyxpooVpjpFcE4vmfj7DWUkKpjaXcm9L3MroT1KaE8k6F9dAE6y</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>The complexity of matrix rank and feasible systems of linear equations</title><source>SpringerNature Journals</source><creator>Allender, E. ; Beals, R. ; Ogihara, M.</creator><creatorcontrib>Allender, E. ; Beals, R. ; Ogihara, M.</creatorcontrib><identifier>ISSN: 1016-3328</identifier><identifier>EISSN: 1420-8954</identifier><identifier>DOI: 10.1007/s000370050023</identifier><language>eng</language><ispartof>Computational complexity, 1999-01, Vol.8 (2), p.99-126</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c235t-e530e6e420e22441dc219632f6dc500051cc0c58ad4d5e2c944547d7ef8fd0663</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,782,786,27933,27934</link.rule.ids></links><search><creatorcontrib>Allender, E.</creatorcontrib><creatorcontrib>Beals, R.</creatorcontrib><creatorcontrib>Ogihara, M.</creatorcontrib><title>The complexity of matrix rank and feasible systems of linear equations</title><title>Computational complexity</title><issn>1016-3328</issn><issn>1420-8954</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1999</creationdate><recordtype>article</recordtype><recordid>eNpVkEtLAzEUhYMoWKtL9_kD0ZvnzCylWBUKbup6iMkNRudRc0fo_HtbdNPVOYvD4eNj7FbCnQSo7gkAdAVgAZQ-YwtpFIi6seb80EE6obWqL9kV0SeAtLU2C7befiAPY7_rcJ-nmY-J934qec-LH764HyJP6Cm_d8hppgl7Om66PKAvHL9__JTHga7ZRfId4c1_Ltnb-nG7ehab16eX1cNGBKXtJNBqQIcHLlTKGBmDko3TKrkYDtRgZQgQbO2jiRZVaIyxpooVpjpFcE4vmfj7DWUkKpjaXcm9L3MroT1KaE8k6F9dAE6y</recordid><startdate>19990101</startdate><enddate>19990101</enddate><creator>Allender, E.</creator><creator>Beals, R.</creator><creator>Ogihara, M.</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>19990101</creationdate><title>The complexity of matrix rank and feasible systems of linear equations</title><author>Allender, E. ; Beals, R. ; Ogihara, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c235t-e530e6e420e22441dc219632f6dc500051cc0c58ad4d5e2c944547d7ef8fd0663</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1999</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Allender, E.</creatorcontrib><creatorcontrib>Beals, R.</creatorcontrib><creatorcontrib>Ogihara, M.</creatorcontrib><collection>CrossRef</collection><jtitle>Computational complexity</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Allender, E.</au><au>Beals, R.</au><au>Ogihara, M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The complexity of matrix rank and feasible systems of linear equations</atitle><jtitle>Computational complexity</jtitle><date>1999-01-01</date><risdate>1999</risdate><volume>8</volume><issue>2</issue><spage>99</spage><epage>126</epage><pages>99-126</pages><issn>1016-3328</issn><eissn>1420-8954</eissn><doi>10.1007/s000370050023</doi><tpages>28</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1016-3328 |
| ispartof | Computational complexity, 1999-01, Vol.8 (2), p.99-126 |
| issn | 1016-3328 1420-8954 |
| language | eng |
| recordid | cdi_crossref_primary_10_1007_s000370050023 |
| source | SpringerNature Journals |
| title | The complexity of matrix rank and feasible systems of linear equations |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-03T02%3A54%3A17IST&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=The%20complexity%20of%20matrix%20rank%20and%20feasible%20systems%20of%20linear%20equations&rft.jtitle=Computational%20complexity&rft.au=Allender,%20E.&rft.date=1999-01-01&rft.volume=8&rft.issue=2&rft.spage=99&rft.epage=126&rft.pages=99-126&rft.issn=1016-3328&rft.eissn=1420-8954&rft_id=info:doi/10.1007/s000370050023&rft_dat=%3Ccrossref%3E10_1007_s000370050023%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 |