Computing minimal models by partial instantiation

Author： Kagan V. Nerode A. Subrahmanian V.S.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.155, Iss.1, 1996-02, pp. : 157-177

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

Computing the Map of Geometric Minimal Cuts

By Xu Jinhui Xu Lei Papadopoulou Evanthia

Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. : 805-834

Springer Publishing Company

Access to resources Recommend Favorite

Computing minimal generators of the ideal of a general projective curve

By Ballico E. Orecchia F.

Journal of Symbolic Computation, Vol. 37, Iss. 3, 2004-03 ,pp. : 295-304

Elsevier

Access to resources Recommend Favorite

Maximum Cardinality Search for Computing Minimal Triangulations of Graphs

By Berry Anne Blair Jean R. S. Heggernes Pinar Peyton Barry W.

Algorithmica, Vol. 39, Iss. 4, 2004-05 ,pp. : 287-298

Springer Publishing Company

Access to resources Recommend Favorite

A behaviour instantiation agent architecture

By Song Hongjun Franklin Stan

Connection Science, Vol. 12, Iss. 1, 2000-03 ,pp. : 21-44

Taylor & Francis Ltd

Access to resources Recommend Favorite

An efficient computing strategy for prediction in mixed linear models

By Gilmour A. Cullis B. Welham S. Gogel B. Thompson R.

Computational Statistics and Data Analysis, Vol. 44, Iss. 4, 2004-01 ,pp. : 571-586

Elsevier

Access to resources Recommend Favorite