Proof complexity
id:
proof-complexity-293-4877634
title:
Proof complexity
text:
In logic and theoretical computer science, and specifically proof theory and computational complexity theory, proof complexity is the field aiming to understand and analyse the computational resources that are required to prove or refute statements. Research in proof complexity is predominantly concerned with proving proof-length lower and upper bounds in various propositional proof systems. For example, among the major challenges of proof complexity is showing that the Frege system, the usual p
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Proof_complexity
date created:
date modified:
2024-02-21T14:07:58Z
main entity:
{"identifier":"Q7249999","url":"https://www.wikidata.org/entity/Q7249999"}
image:
fields total:
13
integrity:
13