Enumerating Denumerable Sets in Polynomial Time via the Schröder-Bernstein Theorem.

Reinhold Burger

Published in: ISSAC (2022)

Keyphrases

finite sets
computational complexity
special case
machine learning
worst case
neural network
rough sets
approximation algorithms
convex sets
von neumann