Equivalence of Keyed Relational Schemas by Conjunctive Queries

By Albert J.   Ioannidis Y.   Ramakrishnan R.  

Journal of Computer and System Sciences, Vol. 58, Iss. 3, 1999-06 ,pp. : 512-534

Academic Press

Access to resources Recommend Favorite

The tree equivalence of linear recursion schemes

By Sabelfeld V.  

Theoretical Computer Science, Vol. 238, Iss. 1, 2000-05 ,pp. : 1-29

Elsevier

Access to resources Recommend Favorite

Program logic and equivalence in the presence of garbage collection

By Calcagno C.   O'Hearn P.   Bornat R.  

Theoretical Computer Science, Vol. 298, Iss. 3, 2003-04 ,pp. : 557-581

Elsevier

Access to resources Recommend Favorite

The inclusion problem for some subclasses of context-free languages - a subcase with a decidable inclusion problem

By Asveld P.R.J.P.R.J.   Nijholt A.  

Theoretical Computer Science, Vol. 230, Iss. 1, 2000-01 ,pp. : 247-256

Elsevier

Access to resources Recommend Favorite

On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms

By Shalev-Shwartz Shai  

Machine Learning, Vol. 80, Iss. 2-3, 2010-09 ,pp. : 141-163

Springer Publishing Company

Access to resources Recommend Favorite