| Ditemukan 35 dokumen dengan kata kunci 4676 |
Simpan CSV  |
|
On Computational Complexity of Semilinear Varieties
|
| Pengarang: Enrico Marchioni | No. Panggil: Journal of Logic and Computation December 2008, 18 (6), p. 941-958 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Average-Case Complexity
|
|
|
|
Moving the mountain: analysis of the effort required to transform comparative anatomy into computable anatomy
|
| Pengarang: Wasila Dahdul, T. Alexander Dececchi, Nizar Ibrahim, Hilmar Lapp, and Paula Mabee | No. Panggil: Database (Volume 2015, p. bav040) |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Differential and integral calculus for logical operations. A matrix–vector approach
|
| Pengarang: Eduardo Mizraji | No. Panggil: Journal of Logic and Computation (Volume 25 Issue 3 june 2015, p. (613-638) |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Almost structurally complete infinitary consequence operations extending S4.3
|
| Pengarang: Wojciech Dzik and Piotr Wojtylak | No. Panggil: Logic Journal of the IGPL (Volume 23 Issue 4 August 2015, p. 640-661) |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Joining non-low C.E. sets with diagonally non-computable functions
|
| Pengarang: Laurent Bienvenu, Noam Greenberg, Antonín Kučera, Joseph S. Miller, dll | No. Panggil: Journal of Logic and Computation December 2013; 23 (6), p. 1183-1194 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
RZ: a Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
|
| Pengarang: Andrej Bauer and Christopher A. Stone | No. Panggil: Journal of Logic and Computation February 2009, 19 (1), p. 17-43 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Elementarily equivalent structures for topological languages over regions in Euclidean space
|
| Pengarang: Ernest Davis | No. Panggil: Journal of Logic and Computation June 2013, 23 (3), p. 457-471 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
The complexity of reasoning for fragments of default logic
|
| Pengarang: Olaf Beyersdorff, Arne Meier, Michael Thomas, and Heribert Vollmer | No. Panggil: Journal of Logic and Computation June 2012, 22 (3), p. 587-604 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Triviality and Minimality in the Degrees of Monotone Complexity
|
| Pengarang: William C. Calhoun | No. Panggil: Journal of Logic and Computation April 2012, 22 (2), p. 197-206 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
Hasil Pencarian
