The following pages link to Certifying algorithms (Q465678):
Displaying 13 items.
- Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (Q5205041) (← links)
- A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS (Q5247063) (← links)
- On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency (Q5881540) (← links)
- A proof system for graph (non)-isomorphism verification (Q5883756) (← links)
- Colouring graphs with no induced six-vertex path or diamond (Q5925590) (← links)
- Colouring graphs with no induced six-vertex path or diamond (Q5972261) (← links)
- A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs (Q6039897) (← links)
- Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs (Q6180578) (← links)
- Verified Textbook Algorithms (Q6485853) (← links)
- Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)
- Certificates for probabilistic pushdown automata via optimistic value iteration (Q6536144) (← links)
- Certifying induced subgraphs in large graphs (Q6636998) (← links)
- Incorporating a database of graphs into a proof assistant (Q6648164) (← links)
