D-Net

<?xml version="1.0" encoding="UTF-8"?>

<oaf:entity xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"

    xmlns:oaf="http://namespace.openaire.eu/oaf"

    xsi:schemaLocation="http://namespace.openaire.eu/oaf ../oaf-0.3.xsd">

    <oaf:result>

        <subject classid="keyword" classname="keyword" schemeid="dnet:result_subject"

            schemename="dnet:result_subject">matrices</subject>

        <subject classid="keyword" classname="keyword" schemeid="dnet:result_subject"

            schemename="dnet:result_subject">info:eu-repo/classification/acm/G.2.2 Graph

            Theory</subject>

        <title classid="main title" classname="main title" schemeid="dnet:dataCite_title"

            schemename="dnet:dataCite_title">On the hardness of approximating the permanent of

            structured matrices</title>

        <dateofacceptance>2003-01-01</dateofacceptance>

        <publisher>Birkhauser Verlag</publisher>

        <resulttype classid="publication" classname="publication" schemeid="dnet:result_typologies"

            schemename="dnet:result_typologies"/>

        <language classid="eng" classname="English" schemeid="dnet:languages"

            schemename="dnet:languages"/>

        <description>We show that for several natural classes of "structured" matrices, including symmetric, circulant, Hankel and Toeplitz matrices, approximating the permanent modulo a prime p is as hard as computing its exact value. Results of this kind are well known for arbitrary matrices. However the techniques used do not seem to apply to "structured" matrices. Our approach is based on recent advances in the hidden number problem introduced by Boneh and Venkatesan in 1996 combined with some bounds of exponential sums motivated by the Waring problem in finite fields.</description>

        <source>In: COMPUTATIONAL COMPLEXITY (11387J0), vol. 11 pp. 158 - 170. Birkhauser Verlag, 2003.</source>

        <country classid="" classname="" schemeid="" schemename=""/>

        <relevantdate classid="" classname="" schemeid="" schemename=""/>

        <embargoenddate/>

        <fulltext/>

        <format/>

        <storagedate/>

        <resourcetype classid="" classname="" schemeid="" schemename=""/>

        <device/>

        <size/>

        <version/>

        <lastmetadataupdate/>

        <metadataversionnumber/>

        <originalId>oai:pumaoai.isti.cnr.it:cnr.iit/cnr.iit/2003-A0-005</originalId>

        <collectedfrom name="PUblication MAnagement"

            id="opendoar____::300891a62162b960cf02ce3827bb363c"/>

        <pid classid="oai" classname="oai" schemeid="dnet:pid_types" schemename="dnet:pid_types"

            >oai:pumaoai.isti.cnr.it:cnr.iit/cnr.iit/2003-A0-005</pid>

        <bestlicense classid="OPEN" classname="Open Access" schemeid="dnet:access_modes"

            schemename="dnet:access_modes"/>

        <context id="ARC" label="Australian Research Council (ARC)" type="funding">

            <category id="ARC::Discovery Projects" label="Discovery Projects"/>

        </context>

        <datainfo>

            <inferred>false</inferred>

            <deletedbyinference>false</deletedbyinference>

            <trust>0.9</trust>

            <inferenceprovenance/>

            <provenanceaction classid="sysimport:crosswalk:repository"

                classname="sysimport:crosswalk:repository" schemeid="dnet:provenanceActions"

                schemename="dnet:provenanceActions"/>

        </datainfo>

        <rels>

            <rel inferred="true" trust="0.9" inferenceprovenance=""

                provenanceaction="sysimport:crosswalk:repository">

                <to class="hasAuthor" scheme="dnet:personroles" type="person">dedup_wf_001::e3874ae0dfae0aeb0eb7c9de34d44abf</to>

                <ranking>1</ranking>

                <fullname>Codenotti, Bruno</fullname>

            </rel>

            <rel inferred="true" trust="0.72" inferenceprovenance="iis::document_referencedProjects"

                provenanceaction="iis">

                <to class="isProducedBy" scheme="dnet:result_project_relations" type="project">arc_________::f2a577c42e672ed01e5272cfdc2ccc25</to>

                <websiteurl>http://purl.org/au-research/grants/arc/DP0211459</websiteurl>

                <code>DP0211459</code>

                <title>Number Theoretic Methods in Cryptography</title>

                <funding>

                    <funder id="arc_________::ARC" shortname="ARC"

                        name="Australian Research Council (ARC)" jurisdiction="AU"/>

                    <funding_level_0 name="Discovery Projects">arc_________::ARC::Discovery Projects</funding_level_0>

                </funding>

            </rel>

        </rels>

        <children>

            <instance id="opendoar____::300891a62162b960cf02ce3827bb363c">

                <licence classid="OPEN" classname="Open Access" schemeid="dnet:access_modes"

                    schemename="dnet:access_modes"/>

                <instancetype classid="0001" classname="Article"

                    schemeid="dnet:publication_resource" schemename="dnet:publication_resource"/>

                <hostedby name="PUblication MAnagement"

                    id="opendoar____::300891a62162b960cf02ce3827bb363c"/>

                <webresource>

                    <url>http://puma.isti.cnr.it/dfdownloadnew.php?ident=cnr.iit/cnr.iit/2003-A0-005</url>

                </webresource>

                <webresource>

                    <url>http://puma.isti.cnr.it/rmydownload.php?filename=cnr.iit/cnr.iit/2003-A0-005/2003-A0-005.pdf</url>

                </webresource>

            </instance>

        </children>

    </oaf:result>

</oaf:entity>