Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Proof_complexity> ?p ?o }
Showing triples 1 to 52 of
52
with 100 triples per page.
- Proof_complexity abstract "In computer science, proof complexity is a measure of efficiency of automated theorem proving methods that is based on the size of the proofs they produce. The methods for proving contradiction in propositional logic are the most analyzed. The two main issues considered in proof complexity are whether a proof method can produce a polynomial proof of every inconsistent formula, and whether the proofs produced by one method are always of size similar to those produced by another method.".
- Proof_complexity wikiPageExternalLink index.html.
- Proof_complexity wikiPageExternalLink proof-complexity.
- Proof_complexity wikiPageExternalLink node9.html.
- Proof_complexity wikiPageExternalLink book.
- Proof_complexity wikiPageExternalLink catalogue.asp?isbn=9780521517294.
- Proof_complexity wikiPageExternalLink ds1.ps.
- Proof_complexity wikiPageExternalLink ds2.ps.
- Proof_complexity wikiPageExternalLink ecm.pdf.
- Proof_complexity wikiPageID "2801284".
- Proof_complexity wikiPageLength "7837".
- Proof_complexity wikiPageOutDegree "22".
- Proof_complexity wikiPageRevisionID "679160802".
- Proof_complexity wikiPageWikiLink Automated_theorem_proving.
- Proof_complexity wikiPageWikiLink Category:Automated_theorem_proving.
- Proof_complexity wikiPageWikiLink Category:Computational_complexity_theory.
- Proof_complexity wikiPageWikiLink Category:Logic_in_computer_science.
- Proof_complexity wikiPageWikiLink Co-NP.
- Proof_complexity wikiPageWikiLink CoNP.
- Proof_complexity wikiPageWikiLink Computational_complexity_theory.
- Proof_complexity wikiPageWikiLink Computer_science.
- Proof_complexity wikiPageWikiLink Cutting-plane_method.
- Proof_complexity wikiPageWikiLink DPLL_algorithm.
- Proof_complexity wikiPageWikiLink European_Congress_of_Mathematics.
- Proof_complexity wikiPageWikiLink Intuitionistic_logic.
- Proof_complexity wikiPageWikiLink NP_(complexity).
- Proof_complexity wikiPageWikiLink Non-monotonic_logic.
- Proof_complexity wikiPageWikiLink Pigeonhole_principle.
- Proof_complexity wikiPageWikiLink Polynomial_hierarchy.
- Proof_complexity wikiPageWikiLink Propositional_calculus.
- Proof_complexity wikiPageWikiLink Propositional_logic.
- Proof_complexity wikiPageWikiLink Propositional_proof_system.
- Proof_complexity wikiPageWikiLink Resolution_(logic).
- Proof_complexity wikiPageWikiLink Sequent_calculus.
- Proof_complexity wikiPageWikiLink Toniann_Pitassi.
- Proof_complexity wikiPageWikiLinkText "Proof complexity".
- Proof_complexity wikiPageWikiLinkText "proof complexity".
- Proof_complexity hasPhotoCollection Proof_complexity.
- Proof_complexity subject Category:Automated_theorem_proving.
- Proof_complexity subject Category:Computational_complexity_theory.
- Proof_complexity subject Category:Logic_in_computer_science.
- Proof_complexity hypernym Measure.
- Proof_complexity type Work.
- Proof_complexity type Method.
- Proof_complexity type Proof.
- Proof_complexity comment "In computer science, proof complexity is a measure of efficiency of automated theorem proving methods that is based on the size of the proofs they produce. The methods for proving contradiction in propositional logic are the most analyzed. The two main issues considered in proof complexity are whether a proof method can produce a polynomial proof of every inconsistent formula, and whether the proofs produced by one method are always of size similar to those produced by another method.".
- Proof_complexity label "Proof complexity".
- Proof_complexity sameAs m.083kkz.
- Proof_complexity sameAs Q7249999.
- Proof_complexity sameAs Q7249999.
- Proof_complexity wasDerivedFrom Proof_complexity?oldid=679160802.
- Proof_complexity isPrimaryTopicOf Proof_complexity.