Universal Relations and #P-Completeness
Uloženo v:
| Vydáno v: | Theoretical Computer Science Ročník 407; s. 97 - 109 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | japonština |
| Vydáno: |
Springer Berlin Heidelberg
01.01.2006
|
| Témata: | |
| ISSN: | 0304-3975 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Author | Malod, Guillaume Fournier, Hervé |
|---|---|
| Author_xml | – sequence: 1 fullname: Fournier, Hervé – sequence: 2 fullname: Malod, Guillaume |
| BackLink | https://cir.nii.ac.jp/crid/1871146593103829376$$DView record in CiNii |
| BookMark | eNotjk1LAzEUAHOoYK39Ad4WFDwlvuTl8yiLVqGgSD1LsvsCKWtWzOLvV9HLzG2YM7aqcyXGLiQICdLeHMUyNKEAvAAjAHDF1oCgOQZnTtm2tZIArNHa-rBm16-1fNFni1P3QlNcylxbF-vYXT7zfn7_mGihSq2ds5Mcp0bbf2_Y4f7u0D_w_dPusb_d82Mwlg8DESWFKoLLA8RRGmWNTV67YLIbRzA566SywlGm6BOSCil4F5RJP4O4YVd_2VrK21B-Kb2TUlsTUAJ6FdBZ_Abqt0Fd |
| ContentType | Journal Article |
| Contributor | Moudenner Cohen, Isabelle Parallélisme, Réseaux, Systèmes, Modélisation (PRISM) ; Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Centre National de la Recherche Scientifique (CNRS) |
| Contributor_xml | – sequence: 1 fullname: Parallélisme, Réseaux, Systèmes, Modélisation (PRISM) ; Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Centre National de la Recherche Scientifique (CNRS) – sequence: 2 fullname: Moudenner Cohen, Isabelle |
| DBID | RYH |
| DOI | 10.1016/j.tcs.2008.05.003 10.1007/11758471_35 |
| DatabaseName | CiNii Complete |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EndPage | 109 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN AABNK AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AATTM AAXKI AAXUO AAYFN AAYWO ABAOU ABBOA ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFS ACLOT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADMUD ADNMO ADVLN AEBSH AEIPS AEKER AENEX AEUPX AEXQZ AFPUW AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-9 P2P PC. Q38 ROL RPZ RYH SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- ~HD |
| ID | FETCH-LOGICAL-j956-cceeeb232a07fc0ad152656b84795f7dd05ff4b2f23d1ba8b3e29b987925b3973 |
| ISSN | 0304-3975 |
| IngestDate | Mon Nov 10 09:08:57 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | Japanese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-j956-cceeeb232a07fc0ad152656b84795f7dd05ff4b2f23d1ba8b3e29b987925b3973 |
| OpenAccessLink | https://cir.nii.ac.jp/crid/1871146593103829376 |
| PageCount | 13 |
| ParticipantIDs | nii_cinii_1871146593103829376 |
| PublicationCentury | 2000 |
| PublicationDate | 2006-01-01 |
| PublicationDateYYYYMMDD | 2006-01-01 |
| PublicationDate_xml | – month: 01 year: 2006 text: 2006-01-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Theoretical Computer Science |
| PublicationYear | 2006 |
| Publisher | Springer Berlin Heidelberg |
| Publisher_xml | – name: Springer Berlin Heidelberg |
| SSID | ssib006544689 ssib006544688 ssib006544687 ssib045031228 ssj0000576 ssib027713478 |
| Score | 1.8354034 |
| SourceID | nii |
| SourceType | Publisher |
| StartPage | 97 |
| SubjectTerms | [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC] Computational complexity Computer Science(all) Counting problems Theoretical Computer Science |
| Title | Universal Relations and #P-Completeness |
| URI | https://cir.nii.ac.jp/crid/1871146593103829376 |
| Volume | 407 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 customDbUrl: isFulltext: true dateEnd: 20180131 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000576 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LS8NAEF609aAH3-KrElDxIJE0m83uHkXqC5QeeuhNsskGEkoU04o_39lXqlVRD16WJilNh5md_XZ2Zj6EjhLKQxpirKI2gR8JJn0uuPBFBFgkiSVlkdBkE_T-ng2HvG8522tNJ0Crir2-8qd_VTXcA2Wr0tk_qLv5UbgBn0HpMILaYfyV4m2qhW6a7xLdVHT8OMR9X03_kcLJLvGibKylqWd0RA9u3k8XKnh7YVR8DS7GnLFPQ9ojk7xzNVFERhPbBOG7gIILKJ5-129L11qp8xRuOE-cH40Mfa31hCbr1q6pXd0C4bO7NpGD8myc1jatVUW48Nff1dkcqrOoWlAfMJlH7ZASzlqofX7TG95O3QiBPS6jM9ds5rpBcSHV9bTN84iAo9NxMbegE2qOvK3QtsxTVWC--zvuyFwnD84IBMClKop3wGWwipbtjsM7N5ayhubKZB2tOCV7VsnraOmu6eBbb6CTxoy8xow8MCPv8KMRbaLBZW9wce1bUg2_VC0nUwBFUgCMTgKap0GSdRU_QixACE5ymmUByfNIhHmIs65ImMAyhMnLYEoTAcLjLdSqHiu5jbxc0kihZQkgOJJxzjIc5wInCQtEBq5hB3VA6Ie0UGMXNuawKBOueO0YYEwa7_7wfA8tTs1zH7XGzxPZQQvpy7ionw-s0t8A2alL1A |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Universal+Relations+and+%23P-Completeness&rft.jtitle=Theoretical+Computer+Science&rft.au=Fournier%2C+Herv%C3%A9&rft.au=Malod%2C+Guillaume&rft.date=2006-01-01&rft.pub=Springer+Berlin+Heidelberg&rft.issn=0304-3975&rft.volume=407&rft.spage=97&rft.epage=109&rft_id=info:doi/10.1016%2Fj.tcs.2008.05.003&rft_id=info:doi/10.1007%2F11758471_35 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |