exponential time hypothesis (Q5421532)

From Wikidata
Jump to navigation Jump to search
unproven computational hardness assumption that 3-SAT isn’t solvable in subexponential time in the worst case
  • ETH
edit
Language Label Description Also known as
English
exponential time hypothesis
unproven computational hardness assumption that 3-SAT isn’t solvable in subexponential time in the worst case
  • ETH

Statements

0 references

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit