English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Discovering All Most Specific Sentences by Randomized Algorithms - Extended Abstract

MPS-Authors
/persons/resource/persons44545

Gunopulos,  Dimitrios
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44982

Mannila,  Heikki
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45339

Saluja,  Sanjeev
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dtpTL
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Gunopulos, D., Mannila, H., & Saluja, S. (1997). Discovering All Most Specific Sentences by Randomized Algorithms - Extended Abstract. In F. Afrati, & P. Kolaitis (Eds.), Proceedings of the 6th International Conference on Database Theory (ICDT-97) (pp. 215-229). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-391D-0
Abstract
There is no abstract available