Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Dörfler marking with minimal cardinality is a linear complexity problem."

Carl-Martin Pfeiler, Dirk Praetorius (2020)

> Home

Details and statistics

DOI: 10.1090/MCOM/3553

access: closed

type: Journal Article

metadata version: 2020-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/moc/PfeilerP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/moc/PfeilerP20
Carl-Martin Pfeiler, Dirk Praetorius:
Dörfler marking with minimal cardinality is a linear complexity problem. Math. Comput. 89(326): 2735-2752 (2020)

a service of

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.