Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/MAX-3SAT> ?p ?o }
Showing triples 1 to 61 of
61
with 100 triples per page.
- MAX-3SAT abstract "MAX-3SAT is a problem in the computational complexity subfield of computer science. It generalises the Boolean satisfiability problem (SAT) which is a decision problem considered in complexity theory. It is defined as:Given a 3-CNF formula Φ (i.e. with at most 3 variables per clause), find an assignment that satisfies the largest number of clauses.MAX-3SAT is a canonical complete problem for the complexity class MAXSNP (shown complete in Papadimitriou pg. 314).".
- MAX-3SAT wikiPageExternalLink coding-theory.
- MAX-3SAT wikiPageExternalLink notes.
- MAX-3SAT wikiPageID "3208218".
- MAX-3SAT wikiPageLength "9508".
- MAX-3SAT wikiPageOutDegree "37".
- MAX-3SAT wikiPageRevisionID "673859353".
- MAX-3SAT wikiPageWikiLink 2-satisfiability.
- MAX-3SAT wikiPageWikiLink 2SAT.
- MAX-3SAT wikiPageWikiLink 3-CNF.
- MAX-3SAT wikiPageWikiLink 3-SAT.
- MAX-3SAT wikiPageWikiLink Boolean_algebra.
- MAX-3SAT wikiPageWikiLink Boolean_logic.
- MAX-3SAT wikiPageWikiLink Boolean_satisfiability_problem.
- MAX-3SAT wikiPageWikiLink Category:NP-hard_problems.
- MAX-3SAT wikiPageWikiLink Category:Satisfiability_problems.
- MAX-3SAT wikiPageWikiLink Complete_(complexity).
- MAX-3SAT wikiPageWikiLink Computational_complexity_theory.
- MAX-3SAT wikiPageWikiLink Computer_science.
- MAX-3SAT wikiPageWikiLink Conjunctive_normal_form.
- MAX-3SAT wikiPageWikiLink Decision_problem.
- MAX-3SAT wikiPageWikiLink Error_correcting_codes.
- MAX-3SAT wikiPageWikiLink Forward_error_correction.
- MAX-3SAT wikiPageWikiLink Karloff-Zwick_algorithm.
- MAX-3SAT wikiPageWikiLink Karloff–Zwick_algorithm.
- MAX-3SAT wikiPageWikiLink MAX-2SAT.
- MAX-3SAT wikiPageWikiLink MAX-3LIN-EQN.
- MAX-3SAT wikiPageWikiLink MAXEkSAT.
- MAX-3SAT wikiPageWikiLink MAXSNP.
- MAX-3SAT wikiPageWikiLink NP-complete.
- MAX-3SAT wikiPageWikiLink NP-completeness.
- MAX-3SAT wikiPageWikiLink NP-hard.
- MAX-3SAT wikiPageWikiLink NP-hardness.
- MAX-3SAT wikiPageWikiLink PCP_(complexity).
- MAX-3SAT wikiPageWikiLink PCP_theorem.
- MAX-3SAT wikiPageWikiLink P_=_NP.
- MAX-3SAT wikiPageWikiLink P_versus_NP_problem.
- MAX-3SAT wikiPageWikiLink Polynomial-time.
- MAX-3SAT wikiPageWikiLink Probabilistic.
- MAX-3SAT wikiPageWikiLink Probabilistically_checkable_proof.
- MAX-3SAT wikiPageWikiLink Probability.
- MAX-3SAT wikiPageWikiLink SAT.
- MAX-3SAT wikiPageWikiLink SNP_(complexity).
- MAX-3SAT wikiPageWikiLink Time_complexity.
- MAX-3SAT wikiPageWikiLinkText "MAX-3SAT".
- MAX-3SAT wikiPageWikiLinkText "MAX-3SAT#Related problems".
- MAX-3SAT wikiPageWikiLinkText "MAX-3SAT-3".
- MAX-3SAT hasPhotoCollection MAX-3SAT.
- MAX-3SAT wikiPageUsesTemplate Template:Reflist.
- MAX-3SAT subject Category:NP-hard_problems.
- MAX-3SAT subject Category:Satisfiability_problems.
- MAX-3SAT hypernym Problem.
- MAX-3SAT type Disease.
- MAX-3SAT type Method.
- MAX-3SAT comment "MAX-3SAT is a problem in the computational complexity subfield of computer science. It generalises the Boolean satisfiability problem (SAT) which is a decision problem considered in complexity theory. It is defined as:Given a 3-CNF formula Φ (i.e. with at most 3 variables per clause), find an assignment that satisfies the largest number of clauses.MAX-3SAT is a canonical complete problem for the complexity class MAXSNP (shown complete in Papadimitriou pg. 314).".
- MAX-3SAT label "MAX-3SAT".
- MAX-3SAT sameAs m.08zdc5.
- MAX-3SAT sameAs Q17080570.
- MAX-3SAT sameAs Q17080570.
- MAX-3SAT wasDerivedFrom MAX-3SAT?oldid=673859353.
- MAX-3SAT isPrimaryTopicOf MAX-3SAT.