<?xml version='1.0' encoding='utf-8'?>
<?xml-stylesheet type="text/xsl" href="/v2/static/oai2.xsl"?>
<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-10-08T00:40:28Z</responseDate>
  <request identifier="oai:figshare.com:article/34018356" metadataPrefix="oai_dc" verb="GetRecord">https://api.figshare.com/v2/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:figshare.com:article/34018356</identifier>
        <datestamp>2026-09-28T19:47:02Z</datestamp>
        <setSpec>category_29821</setSpec>
        <setSpec>category_28879</setSpec>
        <setSpec>item_type_8</setSpec>
        <setSpec>month_year_09_2026</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"  xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>A Direct Coordinate-Propagation Algorithm for</dc:title>
          <dc:creator>DURGHAM QARALLEH (21904172)</dc:creator>
          <dc:subject>Numerical and computational mathematics not elsewhere classified</dc:subject>
          <dc:subject>Computer vision</dc:subject>
          <dc:subject>P vs NP Problem</dc:subject>
          <dc:description>&lt;p dir="ltr"&gt;We define a coordinate representation for a restricted class of CNF formulas assembled&lt;/p&gt;&lt;p dir="ltr"&gt;from bounded local cells. Every local Boolean assignment is represented by a normalized&lt;/p&gt;&lt;p dir="ltr"&gt;deficit coordinate, and every clause excludes exactly its unique complementary coordinate on&lt;/p&gt;&lt;p dir="ltr"&gt;its own support. Neighboring cells communicate through shared coordinate interfaces. The&lt;/p&gt;&lt;p dir="ltr"&gt;defining restriction is functional connectivity: an admissible signature of one cell has at most one&lt;/p&gt;&lt;p dir="ltr"&gt;compatible signature in an adjacent cell. For a connected instance with at most k admissible&lt;/p&gt;&lt;p dir="ltr"&gt;signatures per cell and support size at most d, satisfiability is decided by direct propagation&lt;/p&gt;&lt;p dir="ltr"&gt;from at most k root signatures.&lt;/p&gt;</dc:description>
          <dc:date>2026-09-28T19:47:02Z</dc:date>
          <dc:type>Text</dc:type>
          <dc:type>Thesis</dc:type>
          <dc:identifier>10.6084/m9.figshare.34018356.v1</dc:identifier>
          <dc:relation>https://figshare.com/articles/thesis/A_Direct_Coordinate-Propagation_Algorithm_for/34018356</dc:relation>
          <dc:rights>CC BY 4.0</dc:rights>
          <dc:rights>Open Access after 2028-09-28</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
