A proof system for graph (non)-isomorphism verification (Q5883756): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: nauty / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DRAT-trim / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Sledgehammer / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Traces / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: conauto / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4318817948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to ``Milestones in interactive theorem proving'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Sledgehammer with SMT Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Four Colour Theorem: Engineering of a Formal Proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: A FORMAL PROOF OF THE KEPLER CONJECTURE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient verified (UN)SAT certificate checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying Faradžev-Read Type Isomorph-Free Exhaustive Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorph-Free Exhaustive Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalization of Abstract State Transition Systems for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical graph isomorphism. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verified Efficient Enumeration of Plane Graphs Modulo Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SAT and SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2848690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:20, 31 July 2024

scientific article; zbMATH DE number 7667099
Language Label Description Also known as
English
A proof system for graph (non)-isomorphism verification
scientific article; zbMATH DE number 7667099

    Statements

    A proof system for graph (non)-isomorphism verification (English)
    0 references
    0 references
    0 references
    0 references
    22 March 2023
    0 references
    graph isomorphism checking
    0 references
    graph canonical labelling
    0 references
    formal proof system
    0 references
    non-isomorphism certifying
    0 references
    interactive theorem proving
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers