Bounded arithmetic and the polynomial hierarchy

Jan Krajíček, P. P., & Takeuti, G. (1991). Bounded arithmetic and the polynomial hierarchy.

Type

Unclassified

Intellectual base

Unclassified

Year

1991

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Bounded arithmetic
  • … observable transfers from Buss's S2 theories stratify bounded induction so definable or provably total functions align with levels of polynomial-time reasoning. to A proof-complexity argument translates a bounded-arithmetic theorem into polynomial-size propositional proofs and states all uniformity assumptions..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:048e0854e9d2 · see in the full table