Written as an encouragement to the computer algebra community to create a verification competition. It explains why verification competitions are designed the way they are. It also has an analysis of how improving time to solve affects scores where improvements might be shaving a second off the time, adding parallelism, random variations in time, etc.
Benchmarking solvers, SAT-style
Martin Nyx Brain, James H. Davenport, Alberto Griggio[Google Scholar] [DBLP] [Citeseer]
Read: 01 April 2020
Proceedings of the 2nd International Workshop on Satisfiability Checking and Symbolic Computation (SC-Square 2017)
July 2017
Note(s): verification competition
July 2017
Note(s): verification competition