All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Cops-Robber games and the resolution of Tseitin formulas

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F18%3A00491873" target="_blank" >RIV/67985840:_____/18:00491873 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-94144-8_19" target="_blank" >http://dx.doi.org/10.1007/978-3-319-94144-8_19</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-94144-8_19" target="_blank" >10.1007/978-3-319-94144-8_19</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Cops-Robber games and the resolution of Tseitin formulas

  • Original language description

    We characterize several complexity measures for the resolution of Tseitin formulas in terms of a two person cop-robber game. Our game is a slight variation of the one Seymour and Thomas used in order to characterize the tree-width parameter. For any undirected graph, by counting the number of cops needed in our game in order to catch a robber in it, we are able to exactly characterize the width, variable space and depth measures for the resolution of the Tseitin formula corresponding to that graph. We also give an exact game characterization of resolution variable space for any formula.nWe show that our game can be played in a monotone way. This implies that the corresponding resolution measures on Tseitin formulas correspond exactly to those under the restriction of regular resolution.nUsing our characterizations we improve the existing complexity bounds for Tseitin formulas showing that resolution width, depth and variable space coincide up to a logarithmic factor, and that variable space is bounded by the clause space times a logarithmic factor.n

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2018

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Theory and Applications of Satisfiability Testing – SAT 2018

  • ISBN

    978-3-319-94143-1

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    16

  • Pages from-to

    311-326

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Oxford

  • Event date

    Jul 9, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article