Experimental browser for the Atmosphere
The SAT problem asks whether a logical formula, composed of variables and (AND, OR, NOT), can be satisfied by assigning True to the variables. SAT is NP-complete along with 3-SAT, with clauses of three literals, while 2-SAT, is in P! buff.ly/mMLGbw4
Apr 30, 2025, 5:01 AM
{ "uri": "at://did:plc:v2ex7xmwc44boycfxs5bicdg/app.bsky.feed.post/3lnyzbdo4nr2d", "cid": "bafyreihtztd7e5cyntwyuu3j6toeybj742yevmnrcwtsg5ao7gm2isx7ae", "value": { "text": "The SAT problem asks whether a logical formula, composed of variables and (AND, OR, NOT), can be satisfied by assigning True to the variables. SAT is NP-complete along with 3-SAT, with clauses of three literals, while 2-SAT, is in P! buff.ly/mMLGbw4", "$type": "app.bsky.feed.post", "embed": { "$type": "app.bsky.embed.images", "images": [ { "alt": "", "image": { "$type": "blob", "ref": { "$link": "bafkreiaor5tgaii4zzh6zicm565sieegfixo2ecf57wmyorkv6c4uwezfm" }, "mimeType": "image/png", "size": 730587 }, "aspectRatio": { "width": 1920, "height": 1080 } } ] }, "facets": [ { "index": { "byteEnd": 249, "byteStart": 234 }, "features": [ { "uri": "https://buff.ly/mMLGbw4", "$type": "app.bsky.richtext.facet#link" } ] } ], "createdAt": "2025-04-30T05:01:16.381Z" } }