Skip to search formSkip to main contentSkip to account menu

Certifying algorithm

In theoretical computer science, a certifying algorithm is an algorithm that outputs, together with a solution to the problem it solves, a proof that… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
This paper is concerned with the design and analysis of a certifying algorithm for checking the lattice point feasibility of a… 
2016
2016
In this paper we study how graph searching on a cocomparability graph $G$ can be used to produce cocomp orderings (i.e… 
2015
2015
We report work-in-progress on applying the concept of a certifying algorithm to distributed algorithms. A certifying algorithm… 
2015
2015
In this thesis we consider the problem of characterising parameterized graph classes. The parameterized graph classes we consider… 
2013
2013
We provide a fixed-parameter certifying algorithm for the Vertex-deletion problem. An upper bound for the size of the forbidden… 
2010
2010
It is well-known as an existence result that every 3-connected graph G=(V,E) on more than 4 vertices admits a sequence of… 
2010
2010
A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The… 
2008
2008
A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The… 
2005