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”

The Cook-Reckhow definition

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F23%3A10472045" target="_blank" >RIV/00216208:11320/23:10472045 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    The Cook-Reckhow definition

  • Original language description

    We discuss the fundamental notions of proof complexity introduced in the 1979 paper of Cook and Reckhow, and their importance for contemporary research.

  • Czech name

  • Czech description

Classification

  • Type

    C - Chapter in a specialist book

  • CEP classification

  • OECD FORD branch

    10101 - Pure mathematics

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2023

  • 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

  • Book/collection name

    Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook

  • ISBN

    979-8-4007-0779-7

  • Number of pages of the result

    12

  • Pages from-to

    83-94

  • Number of pages of the book

    426

  • Publisher name

    Association for Computing Machinery, New York

  • Place of publication

    New York, USA

  • UT code for WoS chapter