Hasil Pencarian
Ditemukan 117 dokumen dengan kata kunci 4503 Simpan CSV Simpan CSV
Average-Case Complexity
Pengarang: Bogdanov, Andrej | No. Panggil: ebTech - 00081 |
Koleksi: e-Book Teknologi  :: 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  ::
Governance of EU research policy: Charting forms of scientific democracy in the European Research Area
Pengarang: Lorna Ryan | No. Panggil: Science and Public Policy (Volume 42 Issue 3 June 2015, p. 300-314) |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
The influence of industry downturns on the propensity of product versus process innovation
Pengarang: Luca Berchicci, Christopher L. Tucci, and Cristiano Zazzara | No. Panggil: Industrial and Corporate Change (Volume 23 Issue 2 April 2014, p. 429-465) |
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 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  ::
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  ::
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  ::
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  ::
Prev   1 2 3 4 5 6 7 8 9 10  Next