A Quasi-polynomial-time Algorithm for Sampling Words from a Context-Free Language

Author： Gore V.   Jerrum M.   Kannan S.   Sweedyk Z.   Mahaney S.  

Publisher： Academic Press

ISSN： 0890-5401

Source： Information and Computation, Vol.134, Iss.1, 1997-04, pp. : 59-74

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Context-Free Series on Trees

By Bozapalidis S.  

Information and Computation, Vol. 169, Iss. 2, 2001-09 ,pp. : 186-229

Academic Press

Access to resources Recommend Favorite

Context-Free Event Domains Are Recognizable

By Badouel E.   Darondeau P.   Raoult J-C.  

Information and Computation, Vol. 149, Iss. 2, 1999-03 ,pp. : 134-172

Academic Press

Access to resources Recommend Favorite

Computing a Context-Free Grammar-Generating Series

By Litow B.  

Information and Computation, Vol. 169, Iss. 2, 2001-09 ,pp. : 174-185

Academic Press

Access to resources Recommend Favorite

An optimal linear time algorithm for quasi-monotonic segmentation

By Lemire Daniel  

International Journal of Computer Mathematics, Vol. 86, Iss. 7, 2009-07 ,pp. : 1093-1104

Taylor & Francis Ltd

Access to resources Recommend Favorite

A polynomial-time algorithm for linear optimization based on a new simple kernel function

By Bai Y. Q.   Roos C.  

Optimization Methods and Software, Vol. 18, Iss. 6, 2003-12 ,pp. : 631-646

Taylor & Francis Ltd

Access to resources Recommend Favorite