(Q5421532)

English

exponential time hypothesis

unproven computational hardness assumption that 3-SAT isn’t solvable in subexponential time in the worst case

  • ETH
In more languages
default for all languages
No label defined

No description defined

Statements

0 references

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit