On a complexity of the formula \((A\bigvee B) \Rightarrow C\)

DOI10.1016/S0304-3975(98)00074-7zbMath0912.68078OpenAlexW2143728000MaRDI QIDQ1275011

Konstantin Yu. Gorbunov

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00074-7

zbMATH Keywords

algorithmic information theorygame approachcomplexity of formulae

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items

Cryptographic Systems Based on an Algebraic Structure ⋮ Conditional complexity and codes ⋮ Highly connected sets and the excluded grid theorem

Cites Work

• Unnamed Item
• Thermodynamics of computation and information distance

This page was built for publication: On a complexity of the formula \((A\bigvee B) \Rightarrow C\)