"Minimal Counterexamples in O(n log n) Memory and O(n^2) Time."

Henri Hansen, Antti Kervinen (2006)

> Home

Details and statistics

DOI: 10.1109/ACSD.2006.11

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/acsd/HansenK06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acsd/HansenK06
Henri Hansen, Antti Kervinen:
Minimal Counterexamples in O(n log n) Memory and O(n^2) Time. ACSD 2006: 133-142

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.