The Falsification Problem: How Hard Is It to Falsify Heuristics?
- 6 October 2026
- book chapter
- Published by Springer Nature
- p. 290-311
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- $P\mathop{ =}\limits^{?}NP$2016
- David Johnson: Galactic Algorithms2013
- Computational Complexity2009
- If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instancescomputational complexity, 2007
- Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries2006
- Looking for an Analogue of Rice's Theorem in Circuit Complexity TheoryMathematical Logic Quarterly, 2000
- The complexity of symmetric boolean functions1987
- On the Complexity of Derivation in Propositional Calculus1983
- Sparse complete sets for NP: Solution of a conjecture of Berman and HartmanisJournal of Computer and System Sciences, 1982
- Classes of recursively enumerable sets and their decision problemsTransactions of the American Mathematical Society, 1953