natural proof

/N AE1 CH ER0 AH0 L P R UW0 F/
N
  1. 1

    In computational complexity theory, a natural proof is a certain kind of proof establishing that one complexity class differs from another one.

Translate “natural proof” into another language

Choose a language below to open the translator with English selected as the source language.

🇪🇸Spanish🇫🇷French🇩🇪German🇸🇦Arabic🇨🇳Chinese Simplified🇯🇵Japanese🇮🇳Hindi🇧🇷Portuguese🇷🇺Russian🇰🇷Korean🇮🇹Italian🇹🇷Turkish
See all 248+ languages
Back to Dictionary