scientific article; zbMATH DE number 4200143

MaRDI QIDQ3348859zbMATH OpenFDO

Authors Pavel Pudlák

Publication date 1990

zbMATH Keywords

Boolean complexitycircuit complexityRamsey theory

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FOR COMPLEXITY CLASSES
• scientific article; zbMATH DE number 3877162
• scientific article; zbMATH DE number 4181385
• Improved boolean formulas for the Ramsey graphs
• Boolean lattices: Ramsey properties and embeddings

Cited in

(6)

• On the combination of the Bernays-Schönfinkel-Ramsey fragment with simple linear integer arithmetic
• scientific article; zbMATH DE number 3877162 (Why is no real title available?)
• SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FOR COMPLEXITY CLASSES
• A packed Ramsey’s theorem and computability theory
• The canonical Ramsey theorem and computability theory
• An improved protocol for ExactlyN with more than 3 players

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348859)