Hasil Pencarian
Ditemukan 29 dokumen dengan kata kunci 3613 Simpan CSV 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
Pengarang: Bogdanov, Andrej | No. Panggil: ebTech - 00081 |
Koleksi: e-Book Teknologi  :: 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  ::
A binary Routley semantics for intuitionistic De Morgan minimal logic HM and its extensions
Pengarang: Gemma Robles and José M. Méndez | No. Panggil: Logic Journal of the IGPL (Volume 23 Issue 2 April 2015, p. 174-193) |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Recent complexity-theoretic results on P systems with active membranes
Pengarang: Giancarlo Mauri, Alberto Leporati, Antonio E. Porreca, Claudio Zandron | No. Panggil: Journal of Logic and Computation (Volume 25 Issue 4 Agustus 2015, p. 1047- 1071) |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Complexity for probability logic with quantifiers over propositions
Pengarang: Stanislav O. Speranski | No. Panggil: Journal of Logic and Computation October 2013; 23 (5), p. 1035-1055 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Complexity of existential positive first-order logic
Pengarang: Manuel Bodirsky, Miki Hermann, and Florian Richoux | No. Panggil: Journal of Logic and Computation August 2013, 23 (4), p. 753-760 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
The complexity of admissible rules of Łukasiewicz logic
Pengarang: Emil Jeřábek | No. Panggil: Journal of Logic and Computation June 2013, 23 (3), p. 693-705 |
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  ::
Prev   1 2 3  Next