On the Proofs of Some Statements Concerning the Theorems of Kantorovich, Moore, and Miranda

ISSN： 1385-3139

Source： Reliable Computing, Vol.11, Iss.1, 2005-02, pp. : 77-85

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

A Comparison of the Moore and Miranda Existence Tests

By Frommer A. Lang B. Schnurr M.

Computing, Vol. 72, Iss. 3-4, 2004-06 ,pp. : 349-354

Springer Publishing Company

Access to resources Recommend Favorite

Some PAC-Bayesian Theorems

By McAllester D.A.

Machine Learning, Vol. 37, Iss. 3, 1999-12 ,pp. : 355-363

Springer Publishing Company

Access to resources Recommend Favorite

Extended normal form theorems for logical proofs from axioms

By Arai T. Mints G.

Theoretical Computer Science, Vol. 232, Iss. 1, 2000-02 ,pp. : 121-132

Elsevier

Access to resources Recommend Favorite

Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra

By Muller D.E. Schupp P.E.

Theoretical Computer Science, Vol. 141, Iss. 1, 1995-04 ,pp. : 69-107

Elsevier

Access to resources Recommend Favorite

Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties

By Bienvenue A. Francois O.

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 269-289

Elsevier

Access to resources Recommend Favorite