default search action

combined dblp search
author search
venue search
publication search

ask others

"Enumerating Denumerable Sets in Polynomial Time via the ..."

Reinhold Burger (2022)

> Home

Details and statistics

DOI: 10.1145/3476446.3535479

access: closed

type: Conference or Workshop Paper

metadata version: 2022-07-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/issac/Burger22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/issac/Burger22
Reinhold Burger:
Enumerating Denumerable Sets in Polynomial Time via the Schröder-Bernstein Theorem. ISSAC 2022: 391-398

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.