Hasil Pencarian
Ditemukan 31 dokumen dengan kata kunci 4692 Simpan CSV Simpan CSV
Complexity Classifications for Propositional Abduction in Post's Framework
Pengarang: Nadia Creignou, Johannes Schmidt, and Michael Thomas | No. Panggil: Journal of Logic and Computation October 2012, 22 (5), p. 1145-1170 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Expressing versus Proving: Relating Forms of Complexity in Logic
Pengarang: Antonina Kolokolova | No. Panggil: Journal of Logic and Computation April 2012, 22 (2), p. 267-280 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
The Complexity of the Warranted Formula Problem in Propositional Argumentation
Pengarang: Robin Hirsch and Nikos Gorogiannis | No. Panggil: Journal of Logic and Computation April 2010, 20 (2), p. 481-499 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Complexity Issues in Axiomatic Extensions of Łukasiewicz Logic
Pengarang: Petr Cintula and Petr Hájek | No. Panggil: Journal of Logic and Computation April 2009, 19 (2), p. 245-260 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Proof Complexity of the Cut-free Calculus of Structures
Pengarang: Emil Jeřábek | No. Panggil: Journal of Logic and Computation April 2009, 19 (2), p. 323-339 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Borel Complexity of Topological Operations on Computable Metric Spaces
Pengarang: Vasco Brattka and Guido Gherardi | No. Panggil: Journal of Logic and Computation February 2009, 19 (1), p. 45-76 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction
Pengarang: Manuel Bodirsky, Peter Jonsson, and Timo von Oertzen | No. Panggil: Journal of Logic and Computation June 2012, 22 (3), p. 643-660 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Arithmetical Complexity of First-order Predicate Fuzzy Logics Over Distinguished Semantics
Pengarang: Franco Montagna and Carles Noguera | No. Panggil: Journal of Logic and Computation April 2010, 20 (2), p. 399-424 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays
Pengarang: Iain A. Stewart | No. Panggil: Journal of Logic and Computation February 2009, 19 (1), p. 217-242 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Analysis of the complexity of the sperm acrosomal membrane by super-resolution stimulated emission depletion microscopy compared with transmission electron microscopy
Pengarang: Chizuru Ito, Kenji Yamatoya, and Kiyotaka Toshimori | No. Panggil: Microscopy (Volume 64 Issue 4 Agustus 2015, p. 279-287) |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Prev   1 2 3 4  Next