Skip to search formSkip to main contentSkip to account menu

Correctness (computer science)

Known as: Partial, Correctness, Provably correct 
In theoretical computer science, correctness of an algorithm is asserted when it is said that the algorithm is correct with respect to a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
The design and evaluation of Inter-Vehicle Communication (IVC) protocols rely much on the accurate and efficient computational… 
Highly Cited
2001
Highly Cited
2001
We establish a refined search tree technique for the parameterized Dominating Set problem on planar graphs. Here, we are given an… 
Highly Cited
1995
Highly Cited
1995
Artificial "neural networks" are widely used as flexible models for classification and regression applications, but questions… 
Review
1993
Review
1993
Statistical computational linguistics is entering a consolidation phase, signaled by the appearance of book-length tracts devoted… 
Highly Cited
1985
Highly Cited
1985
To keep pace with the trend towards increased circuit integration, printed circuit patterns are becoming denser and more complex… 
Highly Cited
1971
Highly Cited
1971
Edmonds [1] has given an algorithm for constructing a maximum-weight branching in a weighted directed graph. His proof that the…