لا يتم عرض هذه النتيجة على الضيوف.
تسجيل الدخول للوصول الكامل.

المؤلفون: Kovásznai, Gergely, Fröhlich, Andreas, Biere, Armin

المصدر: Theory of Computing Systems. August 2016 59(2):323-376

المؤلفون: Ian Horrocks, David Tena Cucala, Bernardo Cuenca Grau

مصطلحات موضوعية: Linguistics and Language, NEXPTIME, Programming language, Computer science, Web Ontology Language, 02 engineering and technology, Semantic reasoner, Extension (predicate logic), Resolution (logic), Ontology (information science), computer.software_genre, Language and Linguistics, Feature (linguistics), TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Description logic, Artificial Intelligence, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, computer, computer.programming_language

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6ba982f2e205bef9fdcbb1d186f026f
https://doi.org/10.1016/j.artint.2021.103518

المؤلفون: Christoph Scholl, Ralf Wimmer, Aile Ge-Ernst, Jie-Hong R. Jiang

المصدر: AAAI

مصطلحات موضوعية: Discrete mathematics, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, NEXPTIME, Computational complexity theory, Proof calculus, Computer science, Complexity class, General Medicine, Disjoint sets, Decision problem, Time complexity, Subclass, PSPACE

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::5f68afe9f8db9ca52c89ec69bdf3e34a
https://doi.org/10.1609/aaai.v33i01.33011584

المؤلفون: Lidia Tendera, Wiesław Szwast, Ian Pratt-Hartmann

المصدر: Pratt-Hartmann, I, Swast, W & Tendera, L 2019, ' The Fluted Fragment Revisited ', The Journal of Symbolic Logic, vol. 84, no. 3, pp. 1020-1048 . https://doi.org/10.1017/jsl.2019.33

مصطلحات موضوعية: Logic, 0102 computer and information sciences, Quine, 01 natural sciences, 68Q17, Fragment (logic), 0101 mathematics, transitivity, Mathematics, first-order logic, Discrete mathematics, Transitive relation, NEXPTIME, 010102 general mathematics, decidability, fluted fragment, Satisfiability, Decidability, First-order logic, Philosophy, satisfiability, 010201 computation theory & mathematics, satisfability, Boolean satisfiability problem, complexity

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ca858afb85c1e25e158d178a2530b5e
https://doi.org/10.1017/jsl.2019.33

المؤلفون: Ryan Williams, Xin Lyu, Lijie Chen

المصدر: FOCS

مصطلحات موضوعية: Discrete mathematics, NTIME, NEXPTIME, Degree (graph theory), Open problem, 0102 computer and information sciences, 02 engineering and technology, Pseudorandom generator, Function (mathematics), 01 natural sciences, Nondeterministic algorithm, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Almost everywhere, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::0930240bdb671662a72068fd692acb66
https://doi.org/10.1109/focs46700.2020.00009

المؤلفون: Shuichi Hirahara

المصدر: STOC

مصطلحات موضوعية: Discrete mathematics, Conjecture, NEXPTIME, Kolmogorov complexity, Pseudorandomness, 020206 networking & telecommunications, 0102 computer and information sciences, 02 engineering and technology, Pseudorandom generator, Computer Science::Computational Complexity, 01 natural sciences, Upper and lower bounds, Reduction (complexity), 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, PSPACE, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::f7fe80387d7f0165b28890aa9a3a38f9
https://doi.org/10.1145/3357713.3384251

المؤلفون: Joseph Eremondi

المصدر: Lecture Notes in Computer Science ISBN: 9783030471460
TFP

مصطلحات موضوعية: Set (abstract data type), NEXPTIME, Program analysis, 010201 computation theory & mathematics, Computer science, Boolean combination, 0102 computer and information sciences, Pattern matching, 01 natural sciences, Algorithm

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::e5c3983c2312c050016ec59f4cbabfcc
https://doi.org/10.1007/978-3-030-47147-7_6

المؤلفون: Chatterjee, Krishnendu, Katoen, Joost-Pieter, Weininger, Maximilian, Winkler, Tobias

المصدر: Cham, Switzerland : Springer, Lecture notes in computer science 12225, 398-420 (2020). doi:10.1007/978-3-030-53291-8_21
Computer Aided Verification : 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020 : Proceedings, Part II / Shuvendu K. Lahiri, Chao Wang (eds)
Computer Aided Verification : 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020 : Proceedings, Part II / Shuvendu K. Lahiri, Chao Wang (eds)32. International Conference on Computer Aided Verification, CAV 2020, online, 2020-07-21-2020-07-24
Computer Aided Verification ISBN: 9783030532901
CAV (2)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Computer Aided Verification
Computer Aided Verification

مصطلحات موضوعية: Discrete mathematics, FOS: Computer and information sciences, 050101 languages & linguistics, NEXPTIME, Computational complexity theory, Computer science, 05 social sciences, Order (ring theory), 02 engineering and technology, Decision problem, Lexicographical order, Article, Lexicographic preferences, Reachability, Computer Science - Computer Science and Game Theory, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, 0501 psychology and cognitive sciences, PSPACE, Computer Science and Game Theory (cs.GT)

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::089c03a6a5d308d3312c552573f97ff5

المؤلفون: Bin Fu

المصدر: Lecture Notes in Computer Science ISBN: 9783030581497
COCOON

مصطلحات موضوعية: NEXPTIME, 0102 computer and information sciences, 02 engineering and technology, Computer Science::Computational Complexity, Space (mathematics), 01 natural sciences, Nondeterministic algorithm, Set (abstract data type), Combinatorics, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Streaming algorithm, Time complexity, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::23eb670ccf1a0fcd65ca6186f8cc8e20
https://doi.org/10.1007/978-3-030-58150-3_39