Zobraziť v EDS

HOLOGRAPHIC ALGORITHMS.

Uložené v:
Podrobná bibliografia
Názov: HOLOGRAPHIC ALGORITHMS.
Autori: VALIANT, LESLIE G.
Zdroj: SIAM Journal on Computing; 2007, Vol. 37 Issue 5, p1565-1594, 30p, 8 Diagrams, 2 Charts
Predmety: HOLOGRAPHY, ALGORITHM research, POLYNOMIAL time algorithms, COMPUTATIONAL complexity, MANY-valued logic, COMBINATORIAL enumeration problems, COMPUTATIONAL mathematics, MATCHING theory
Abstrakt: Complexity theory is built fundamentally on the notion of efficient reduction among computational problems. Classical reductions involve gadgets that map solution fragments of one problem to solution fragments of another in one-to-one, or possibly one-to-many, fashion. In this paper we propose a new kind of reduction that allows for gadgets with many-to-many correspondences, in which the individual correspondences among the solution fragments can no longer be identified. Their objective may be viewed as that of generating interference patterns among these solution fragments so as to conserve their sum. We show that such holographic reductions provide a method of translating a combinatorial problem to finite systems of polynomial equations with integer coefficients such that the number of solutions of the combinatorial problem can be counted in polynomial time if one of the systems has a solution over the complex numbers. We derive polynomial time algorithms in this way for a number of problems for which only exponential time algorithms were known before. General questions about complexity classes can also be formulated. If the method is applied to a #P-complete problem, then polynomial systems can be obtained, the solvability of which would imply P#P = NC2. [ABSTRACT FROM AUTHOR]
Copyright of SIAM Journal on Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáza: Complementary Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edb&genre=article&issn=00975397&ISBN=&volume=37&issue=5&date=20071001&spage=1565&pages=1565-1594&title=SIAM Journal on Computing&atitle=HOLOGRAPHIC%20ALGORITHMS.&aulast=VALIANT%2C%20LESLIE%20G.&id=DOI:10.1137/070682575
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=VALIANT%20LG
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edb
DbLabel: Complementary Index
An: 85270529
RelevancyScore: 833
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 832.924743652344
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: HOLOGRAPHIC ALGORITHMS.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22VALIANT%2C+LESLIE+G%2E%22">VALIANT, LESLIE G.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: SIAM Journal on Computing; 2007, Vol. 37 Issue 5, p1565-1594, 30p, 8 Diagrams, 2 Charts
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22HOLOGRAPHY%22">HOLOGRAPHY</searchLink><br /><searchLink fieldCode="DE" term="%22ALGORITHM+research%22">ALGORITHM research</searchLink><br /><searchLink fieldCode="DE" term="%22POLYNOMIAL+time+algorithms%22">POLYNOMIAL time algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22COMPUTATIONAL+complexity%22">COMPUTATIONAL complexity</searchLink><br /><searchLink fieldCode="DE" term="%22MANY-valued+logic%22">MANY-valued logic</searchLink><br /><searchLink fieldCode="DE" term="%22COMBINATORIAL+enumeration+problems%22">COMBINATORIAL enumeration problems</searchLink><br /><searchLink fieldCode="DE" term="%22COMPUTATIONAL+mathematics%22">COMPUTATIONAL mathematics</searchLink><br /><searchLink fieldCode="DE" term="%22MATCHING+theory%22">MATCHING theory</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Complexity theory is built fundamentally on the notion of efficient reduction among computational problems. Classical reductions involve gadgets that map solution fragments of one problem to solution fragments of another in one-to-one, or possibly one-to-many, fashion. In this paper we propose a new kind of reduction that allows for gadgets with many-to-many correspondences, in which the individual correspondences among the solution fragments can no longer be identified. Their objective may be viewed as that of generating interference patterns among these solution fragments so as to conserve their sum. We show that such holographic reductions provide a method of translating a combinatorial problem to finite systems of polynomial equations with integer coefficients such that the number of solutions of the combinatorial problem can be counted in polynomial time if one of the systems has a solution over the complex numbers. We derive polynomial time algorithms in this way for a number of problems for which only exponential time algorithms were known before. General questions about complexity classes can also be formulated. If the method is applied to a #P-complete problem, then polynomial systems can be obtained, the solvability of which would imply P<superscript>#P</superscript> = NC2. [ABSTRACT FROM AUTHOR]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of SIAM Journal on Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=85270529
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1137/070682575
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 30
        StartPage: 1565
    Subjects:
      – SubjectFull: HOLOGRAPHY
        Type: general
      – SubjectFull: ALGORITHM research
        Type: general
      – SubjectFull: POLYNOMIAL time algorithms
        Type: general
      – SubjectFull: COMPUTATIONAL complexity
        Type: general
      – SubjectFull: MANY-valued logic
        Type: general
      – SubjectFull: COMBINATORIAL enumeration problems
        Type: general
      – SubjectFull: COMPUTATIONAL mathematics
        Type: general
      – SubjectFull: MATCHING theory
        Type: general
    Titles:
      – TitleFull: HOLOGRAPHIC ALGORITHMS.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: VALIANT, LESLIE G.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 10
              Text: 2007
              Type: published
              Y: 2007
          Identifiers:
            – Type: issn-print
              Value: 00975397
          Numbering:
            – Type: volume
              Value: 37
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: SIAM Journal on Computing
              Type: main
ResultId 1