Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1109556
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proof complexity in algebraic systems and bounded depth Frege systems with modular counting |
scientific article; zbMATH DE number 1109556 |
Statements
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (English)
0 references
29 June 1998
0 references
Frege proof system
0 references
Nullstellensatz proof system
0 references
counting principle
0 references
lower bound
0 references
degree of polynomials
0 references
polynomial calculus proof system
0 references
modular counting
0 references
0 references
0.9303056
0 references
0.9072457
0 references
0.89593893
0 references
0.89593893
0 references
0.8900148
0 references
