KM99] GP Kogan and JA Makowsky. Computing Schur functions for Borchardt matrices. in preparation, 1999. Kog96] GP Kogan. Computing the permanent over elds of characteristic 3: Where and why it becomes dificult. In FOCS'96, pages 108 {114. IEEE, 1996 [Book Review]

, &
Annals of Pure and Applied Logic 78 (2):189-202 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,932

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Kagan, V., Nerode, A. and Subrahmanian, VS., Computing definite logic.M. A. da ArchangelskyTaitslin, S. Artemov, F. A. Bluerle, J. B. Remmel, R. Harper, D. Sannella & A. Tarlecki - 1994 - Annals of Pure and Applied Logic 67:349.
From Ancient to Modern Computing: A History of Information Hiding.F. Gobbo & M. Benini - 2013 - IEEE Annals of the History of Computing 35:33-39.
ABRAMSKY, S., Domain theory in logical form (l-2) l-77 FARMER, WM, A unification-theoretic method for investigat-ing the k-provability problem (3) 173-214 GITIK, M., The strength of the failure of the Singular Cardinal Hypothesis (3) 215-240. [REVIEW]D. Miller - 1991 - Annals of Pure and Applied Logic 51:301.
First Draft of a Report on the EDVAC.John Von Neumann - 1993 - IEEE Annals of the History of Computing 15 (4):27--75.
Finding a History for Software Engineering.M. S. Mahoney - 2004 - Annals of the History of Computing, IEEE 26:8--19.
On existential definitions of c.e. subsets of rings of functions of characteristic 0.Russell Miller & Alexandra Shlapentokh - 2022 - Annals of Pure and Applied Logic 173 (4):103076.
Michael A. Harrison. The number of transitivity sets of Boolean functions. Journal of the Society for Industrial and Applied Mathematics, t. 11 , p. 806–828. - Michael A. Harrison. The number of equivalence classes of Boolean functions under groups containing negation. IEEE transactions on electronic computers, t. EC-12 , p. 559–561. - Michael A. Harrison. On the number of classes of switching networks. Journal of the Franklin Institute, t. 276 , p. 313–327. - Michael A. Harrison. The number of classes of invertible Boolean functions. Journal of the Association for Computing Machinery, t. 10 , p. 25–28. [REVIEW]J. Kuntzmann - 1970 - Journal of Symbolic Logic 35 (1):160-161.
Review of Barry S. Kogan: A Time to Be Born and a Time to Die: The Ethics of Choice.. [REVIEW]John D. Arras - 1994 - Ethics 104 (3):648-650.
Reasoning with belief functions over Belnap–Dunn logic.Marta Bílková, Sabine Frittella, Daniil Kozhemiachenko, Ondrej Majer & Sajad Nazari - 2024 - Annals of Pure and Applied Logic 175 (9):103338.
First-order definitions of rational functions and S -integers over holomorphy rings of algebraic functions of characteristic 0.Alexandra Shlapentokh - 2005 - Annals of Pure and Applied Logic 136 (3):267-283.

Analytics

Added to PP
2014-03-25

Downloads
14 (#994,650)

6 months
14 (#253,070)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dov Gabbay
Hebrew University of Jerusalem

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references