3SAT

Facts from the Community

From the Computer Science base

Complexity:

top ↑

Similar topics in Freebase

  • Travelling salesman problem

    Travelling salesman problem

    The Travelling Salesman Problem (TSP) is a problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once. The problem was...

You can help improve this topic by adding more facts here

Edit this topic
Edit and Show details

Add or delete facts, download data in JSON or RDF formats, and explore topic metadata.

Freebase Logo
What is Freebase?

Freebase is a huge collection of facts, built by people like you. Freebase connects facts in ways other sites can't, giving you new ways to explore millions of subjects.
You can help improve it!

Freebase Attribution

Freebase data is free for use under the CC-BY license.

Learn more about Freebase licensing and attribution