An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic (Q4308607)
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 650776
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic |
scientific article; zbMATH DE number 650776 |
Statements
An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic (English)
0 references
9 October 1994
0 references
fragments of arithmetic
0 references
definable functions
0 references
proof theory
0 references
Boolean complexity
0 references
bounded arithmetic
0 references
polynomial local search
0 references
0.8464124798774719
0 references
0.8458295464515686
0 references
0.8107287883758545
0 references
0.8041066527366638
0 references
