A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity
Crossref DOI link: https://doi.org/10.1007/978-3-319-98355-4_2
Published Online: 2018-08-09
Published Print: 2018
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Hospodár, Michal
Jirásková, Galina
Mlynárčik, Peter
Text and Data Mining valid from 2018-01-01
Version of Record valid from 2018-01-01
Chapter History
First Online: 9 August 2018
Free to read: This content has been made available to all.