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”

First-order reasoning and efficient semi-algebraic proofs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F21%3A00546779" target="_blank" >RIV/67985840:_____/21:00546779 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/LICS52264.2021.9470546" target="_blank" >http://dx.doi.org/10.1109/LICS52264.2021.9470546</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/LICS52264.2021.9470546" target="_blank" >10.1109/LICS52264.2021.9470546</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    First-order reasoning and efficient semi-algebraic proofs

  • Original language description

    Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms [3]: constant degree semi-algebraic proofs lead to conjecturally optimal polynomial-time approximation algorithms for important NP-hard optimization problems (cf. [4]). Motivated by the need to allow a more streamlined and uniform framework for working with SoS proofs than the restrictive propositional level, we initiate a systematic first-order logical investigation into the kinds of reasoning possible in algebraic and semi-algebraic proof systems.

  • 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

    <a href="/en/project/GA19-05497S" target="_blank" >GA19-05497S: Complexity of mathematical proofs and structures</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2021

  • 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

    36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

  • ISBN

    978-1-6654-4896-3

  • ISSN

  • e-ISSN

  • Number of pages

    13

  • Pages from-to

    9470546

  • Publisher name

    IEEE

  • Place of publication

    Piscataway

  • Event location

    Rome

  • Event date

    Jun 29, 2021

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article