<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-21T19:38:28Z</responseDate>
  <request identifier="2412" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2412</identifier>
        <datestamp>2024-03-06T11:09:02Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Small space analogues of Valiant's classes and the limitations of   skew formula</dc:title>
          <dc:creator>Mahajan, Meena</dc:creator>
          <dc:creator>Rao B. V., Raghavendra</dc:creator>
          <dc:subject>Algebraic circuits</dc:subject>
          <dc:subject>space bounds</dc:subject>
          <dc:subject>circuit width</dc:subject>
          <dc:subject>nondeterministic circuits</dc:subject>
          <dc:subject>skew formulas</dc:subject>
          <dc:description>In the uniform circuit model of computation, the width of a boolean&#13;
circuit exactly characterises the ``space'' complexity of the&#13;
computed function. Looking for a similar relationship in Valiant's&#13;
algebraic model of computation, we propose width of an arithmetic&#13;
circuit as a possible measure of space. We introduce the class&#13;
VL as an algebraic variant of deterministic log-space L. In&#13;
the uniform setting, we show that our definition coincides with that&#13;
of VPSPACE at polynomial width.&#13;
&#13;
Further, to define algebraic variants of non-deterministic&#13;
space-bounded classes, we introduce the notion of ``read-once''&#13;
certificates for arithmetic circuits. We show that polynomial-size&#13;
algebraic branching programs can be expressed as a read-once&#13;
exponential sum over polynomials in VL, ie&#13;
$mbox{VBP}inSigma^R cdotmbox{VL}$.&#13;
We also show that $Sigma^R cdot mbox{VBP} =mbox{VBP}$, ie&#13;
VBPs are stable under read-once exponential sums.  Further, we&#13;
show that read-once exponential sums over a restricted class of&#13;
constant-width arithmetic circuits are within VQP, and this is the&#13;
largest known such subclass of poly-log-width circuits with this&#13;
property.&#13;
&#13;
We also study the power of skew formulas and show that exponential&#13;
sums of a skew formula cannot represent the determinant polynomial.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Meena Mahajan and Raghavendra Rao B. V.</dc:contributor>
          <dc:date>2010</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 9421, Algebraic Methods in Computational Complexity (2010)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.09421.7</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-24126</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09421.7</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
