Hasil Pencarian
Ditemukan 16 dokumen dengan kata kunci 3917 Simpan CSV Simpan CSV
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  ::
The Expansion Problem in Lambda Calculi with Explicit Substitution
Pengarang: Ariel Arbiser | No. Panggil: Journal of Logic and Computation December 2008, 18 (6), p. 849-883 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
An improved hybrid algorithm for capacitated fixed-charge transportation problem
Pengarang: Camelia-M. Pintea and Petrică C. Pop | No. Panggil: Logic Journal of the IGPL (Volume 23 Issue 3 June 2015, p. 369-378) |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Polynomial time certifying algorithms for the planar quantified integer programming problem
Pengarang: Z. Liang, K. Subramani, and J. Worthington | No. Panggil: Journal of Logic and Computation October 2013; 23 (5), p. 1017-1033 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
On structural completeness versus almost structural completeness problem: A discriminator varieties case study
Pengarang: Miguel Campercholi, Michał M. Stronkowski, and Diego Vaggione | No. Panggil: Logic Journal of the IGPL (Volume 23 Issue 2 April 2015, p. 235-246) |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
The relaxed linear micromorphic continuum: well-posedness of the static problem and relations to the gauge theory of dislocations
Pengarang: P. Neff, I. D. Ghiba, M. Lazar, and A. Madeo | No. Panggil: The Quarterly Journal of Mechanics and Applied Mathematics (Volume 68 Issue 1 February 2015, p. 53-84) |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Prev   1 2  Next