Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Circuit_satisfiability_problem> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Circuit_satisfiability_problem abstract "In theoretical computer science, the circuit satisfiability problem (also known as CIRCUIT-SAT, CircuitSAT, CSAT, etc.) is the decision problem of determining whether a given Boolean circuit has an assignment of its inputs that makes the output true.".
- Circuit_satisfiability_problem wikiPageID "34599223".
- Circuit_satisfiability_problem wikiPageLength "3411".
- Circuit_satisfiability_problem wikiPageOutDegree "13".
- Circuit_satisfiability_problem wikiPageRevisionID "638909784".
- Circuit_satisfiability_problem wikiPageWikiLink Boolean_circuit.
- Circuit_satisfiability_problem wikiPageWikiLink Boolean_satisfiability_problem.
- Circuit_satisfiability_problem wikiPageWikiLink Category:Computability_theory.
- Circuit_satisfiability_problem wikiPageWikiLink Category:Computational_problems.
- Circuit_satisfiability_problem wikiPageWikiLink Category:NP-complete_problems.
- Circuit_satisfiability_problem wikiPageWikiLink Conjunctive_normal_form.
- Circuit_satisfiability_problem wikiPageWikiLink Cook–Levin_theorem.
- Circuit_satisfiability_problem wikiPageWikiLink Decision_problem.
- Circuit_satisfiability_problem wikiPageWikiLink Functional_completeness.
- Circuit_satisfiability_problem wikiPageWikiLink NP-complete.
- Circuit_satisfiability_problem wikiPageWikiLink NP-completeness.
- Circuit_satisfiability_problem wikiPageWikiLink Netlist.
- Circuit_satisfiability_problem wikiPageWikiLink Satisfiability.
- Circuit_satisfiability_problem wikiPageWikiLink Satisfiability_problem.
- Circuit_satisfiability_problem wikiPageWikiLink Tseitin_transformation.
- Circuit_satisfiability_problem wikiPageWikiLinkText "Circuit satisfiability problem".
- Circuit_satisfiability_problem wikiPageWikiLinkText "satisfiable".
- Circuit_satisfiability_problem hasPhotoCollection Circuit_satisfiability_problem.
- Circuit_satisfiability_problem wikiPageUsesTemplate Template:Main.
- Circuit_satisfiability_problem wikiPageUsesTemplate Template:Reflist.
- Circuit_satisfiability_problem subject Category:Computability_theory.
- Circuit_satisfiability_problem subject Category:Computational_problems.
- Circuit_satisfiability_problem subject Category:NP-complete_problems.
- Circuit_satisfiability_problem hypernym Problem.
- Circuit_satisfiability_problem type Disease.
- Circuit_satisfiability_problem comment "In theoretical computer science, the circuit satisfiability problem (also known as CIRCUIT-SAT, CircuitSAT, CSAT, etc.) is the decision problem of determining whether a given Boolean circuit has an assignment of its inputs that makes the output true.".
- Circuit_satisfiability_problem label "Circuit satisfiability problem".
- Circuit_satisfiability_problem sameAs m.0j256g8.
- Circuit_satisfiability_problem sameAs Q5121622.
- Circuit_satisfiability_problem sameAs Q5121622.
- Circuit_satisfiability_problem wasDerivedFrom Circuit_satisfiability_problem?oldid=638909784.
- Circuit_satisfiability_problem isPrimaryTopicOf Circuit_satisfiability_problem.