Sublinear time algorithms represent a newparadigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input. We discuss the sorts of answers that one might be able to achieve in this new setting.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados