de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Discovering all most specific sentences by randomized algorithms

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44545

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44982

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45339

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
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. 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: http://hdl.handle.net/11858/00-001M-0000-000F-391D-0
Abstract
There is no abstract available