-
1تقرير
المؤلفون: Bozzelli, Laura, Peron, Adriano
المصدر: EPTCS 370, 2022, pp. 97-113
مصطلحات موضوعية: Computer Science - Logic in Computer Science, F.4.1, F.1.1
URL الوصول: http://arxiv.org/abs/2209.10316
-
2تقرير
المؤلفون: Gärtner, Tobias, Ziegler, Martin
المصدر: Logical Methods in Computer Science, Volume 7, Issue 3 (September 2, 2011) lmcs:1019
مصطلحات موضوعية: Computer Science - Logic in Computer Science, Mathematics - Logic, F.4.1, F.1.1, G.1.0
URL الوصول: http://arxiv.org/abs/1006.0398
-
3تقرير
المصدر: Logical Methods in Computer Science, Volume 6, Issue 3 (September 1, 2010) lmcs:783
مصطلحات موضوعية: Computer Science - Computer Science and Game Theory, F.4.1, F.1.1
URL الوصول: http://arxiv.org/abs/0809.4326
-
4دورية أكاديمية
المؤلفون: Tobias Gärtner, Martin Ziegler
المصدر: Logical Methods in Computer Science, Vol Volume 7, Issue 3 (2011)
مصطلحات موضوعية: computer science - logic in computer science, mathematics - logic, f.4.1, f.1.1, g.1.0, Logic, BC1-199, Electronic computers. Computer science, QA75.5-76.95
وصف الملف: electronic resource
-
5دورية أكاديمية
المصدر: Logical Methods in Computer Science, Vol Volume 6, Issue 3 (2010)
مصطلحات موضوعية: computer science - computer science and game theory, f.4.1, f.1.1, Logic, BC1-199, Electronic computers. Computer science, QA75.5-76.95
وصف الملف: electronic resource
-
6
المؤلفون: Zimmermann, Karl-Heinz
مصطلحات موضوعية: Mathematical Logic (F.1.1, I.2.2-4) [F.4.1], Komplexitätstheorie, Complexity Measures and Classes (F.2) (REVISED) [F.1.3], Berechenbarkeit, theoretical computer science, Grammars and Other Rewriting Systems (D.3.1), ddc:510, Mathematik [510], 510: Mathematik, recursion theory, complexity classes, word problems, Nonnumerical Algorithms and Problems (E.2-5, G.2, H.2-3) [F.2.2], undecidability, Mathematik, Grammars and Other Rewriting Systems (D.3.1) [F.4.2], F.4.1, 03-XX:Mathematical logic and foundations, F.4.2, F.2.2, Algebraische Rekursionstheorie, ddc:620, Mathematical Logic (F.1.1, I.2.2-4), Models of Computation (F.4.1), F.1.3:Complexity Measures and Classes (F.2) (REVISED), F.1.2:Modes of Computation, computability theory, Ingenieurwissenschaften [620], complexity theory, 03-XX, Turing machine, Computability, recursion theory, Turing machine, undecidability, word problems, complexity classes, Ingenieurwissenschaften, Theoretische Informatik, Modes of Computation [F.1.2], Models of Computation (F.4.1) [F.1.1], Rekursionstheorie, F.1.1:Models of Computation (F.4.1), computability, Unentscheidbarkeit, Mathematical logic and foundations [03-XX], TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, F.1.2, Complexity Measures and Classes (F.2) (REVISED), Nonnumerical Algorithms and Problems (E.2-5, G.2, H.2-3), ddc:004, F.1.3, complexity, F.1.1
وصف الملف: application/pdf
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::971023795709e91d578d9e184cc6a533
http://tubdok.tub.tuhh.de/handle/11420/1312 -
7
المؤلفون: Zimmermann, Karl-Heinz
مصطلحات موضوعية: computability, computational complexity, Models of Computation (F.4.1), recursion theory, Komplexitätstheorie, Complexity Measures and Classes (F.2) (REVISED) [F.1.3], computability, recursion theory, computational complexity, Berechenbarkeit, Modes of Computation, Theoretische Informatik, Modes of Computation [F.1.2], Complexity Measures and Classes (F.2) (REVISED), F.1.2, ddc:004, F.1.3, Models of Computation (F.4.1) [F.1.1], F.1.1
وصف الملف: application/pdf
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5db993159542434b9d17b6a7333bd9e0
http://tubdok.tub.tuhh.de/handle/11420/1123 -
8مورد إلكتروني
-
9مورد إلكتروني
-
10مورد إلكتروني