"Tight upper bounds on the number of candidate patterns."

Floris Geerts, Bart Goethals, Jan Van den Bussche (2005)

> Home

Details and statistics

DOI: 10.1145/1071610.1071611

access: closed

type: Journal Article

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tods/GeertsGB05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tods/GeertsGB05
Floris Geerts, Bart Goethals, Jan Van den Bussche:
Tight upper bounds on the number of candidate patterns. ACM Trans. Database Syst. 30(2): 333-363 (2005)

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.