CONJUNCTIVE AND DISJUNCTIVE REDUCIBILITIES TO SPARSE AND TALLY SETS REVISITED

DOI10.1142/S0129054194000189zbMath0834.68030MaRDI QIDQ4853331

José D. P. Rolim, Pavol Ďuriš

Publication date: 29 October 1995

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

polynomial-time reducibilities

Mathematics Subject Classification ID

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)