Planar SAT
id:
planar-sat-255-16989708
title:
Planar SAT
text:
In computer science, the planar 3-satisfiability problem (abbreviated PLANAR 3SAT or PL3SAT) is an extension of the classical Boolean 3-satisfiability problem to a planar incidence graph. In other words, it asks whether the variables of a given Boolean formula—whose incidence graph consisting of variables and clauses can be embedded on a plane—can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE. If this is the case, the formula is called sati
brand slug:
wiki
category slug:
encyclopedia
description:
Boolean satisfiability problem restricted to a planar incidence graph
original url:
https://en.wikipedia.org/wiki/Planar_SAT
date created:
date modified:
2024-03-25T21:39:06Z
main entity:
{"identifier":"Q85793509","url":"https://www.wikidata.org/entity/Q85793509"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/c/ca/Planar_SAT_example.png","width":701,"height":810}
fields total:
13
integrity:
15