المؤلفون: Dawar, Anuj, Hella, Lauri

المساهمون: Anuj Dawar and Lauri Hella

مصطلحات موضوعية: generalized quantifiers, constraint satisfaction problems, pebble games, finite variable logics, descriptive complexity theory

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

Relation: Is Part Of LIPIcs, Volume 288, 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.23

الاتاحة: https://doi.org/10.4230/LIPIcs.CSL.2024.23
https://nbn-resolving.org/urn:nbn:de:0030-drops-196662
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.23

المؤلفون: Bhaskar, Siddharth, Lindell, Steven, Weinstein, Scott

المساهمون: Siddharth Bhaskar and Steven Lindell and Scott Weinstein

مصطلحات موضوعية: Model theory, finite model theory, descriptive complexity theory, logarithmic space, graph traversals

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

Relation: Is Part Of OASIcs, Volume 119, The Provenance of Elegance in Computation - Essays Dedicated to Val Tannen (2024); https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Tannen.2

الاتاحة: https://doi.org/10.4230/OASIcs.Tannen.2
https://nbn-resolving.org/urn:nbn:de:0030-drops-200984
https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Tannen.2

المؤلفون: Hella, Lauri

المساهمون: Lauri Hella

مصطلحات موضوعية: generalized quantifiers, constraint satisfaction problems, pebble games, finite variable logics, descriptive complexity theory

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

Relation: Is Part Of LIPIcs, Volume 252, 31st EACSL Annual Conference on Computer Science Logic (CSL 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.25

الاتاحة: https://doi.org/10.4230/LIPIcs.CSL.2023.25
https://nbn-resolving.org/urn:nbn:de:0030-drops-174867
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.25

المؤلفون: Alberto Marcone, Manlio Valenti

المصدر: Fundamenta Mathematicae. 257:69-93

مصطلحات موضوعية: Algebra and Number Theory, Degree (graph theory), Dimension (graph theory), Hausdorff space, Dynamical Systems (math.DS), Mathematics - Logic, Descriptive complexity theory, Ambient space, Combinatorics, Compact space, FOS: Mathematics, 03E15 28A75 28A78 03D32, Family of sets, Mathematics - Dynamical Systems, Logic (math.LO), Mathematics, Descriptive set theory

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4df4d7745bee80bb995e23fe38702e2
https://doi.org/10.4064/fm997-7-2021

المؤلفون: Frank Stephan, André Nies

المصدر: Theoretical Computer Science. 900:1-19

مصطلحات موضوعية: Null set, Discrete mathematics, Mathematics::Logic, General Computer Science, Ergodic theory, Cantor space, Absolute continuity, Descriptive complexity theory, Measure (mathematics), Randomness, Theoretical Computer Science, Mathematics, Probability measure

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::7ac64b56a35abd08dd6ce3ec627f260b
https://doi.org/10.1016/j.tcs.2021.11.003

المؤلفون: Jonni Virtema, Jan Van den Bussche, José María Turull Torres, Flavio Ferrarotti, Senén González

المصدر: Journal of Computer and System Sciences. 119:145-163

مصطلحات موضوعية: Structure (mathematical logic), Theoretical computer science, General Computer Science, Computer Networks and Communications, Computer science, Applied Mathematics, Open problem, 0102 computer and information sciences, 02 engineering and technology, Predicate (mathematical logic), Fixed point, Descriptive complexity theory, Space (mathematics), 01 natural sciences, Domain (mathematical analysis), Theoretical Computer Science, Turing machine, symbols.namesake, Computational Theory and Mathematics, 010201 computation theory & mathematics, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, symbols

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::40bba421040010a39d90507b36e892c3
https://doi.org/10.1016/j.jcss.2021.02.003

المؤلفون: Tejas Bhojraj

المصدر: Theoretical Computer Science. 875:65-80

مصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, General Computer Science, FOS: Physical sciences, 0102 computer and information sciences, 02 engineering and technology, Computer Science::Computational Complexity, Descriptive complexity theory, Type (model theory), Characterization (mathematics), 01 natural sciences, Measure (mathematics), Theoretical Computer Science, Turing machine, symbols.namesake, 0202 electrical engineering, electronic engineering, information engineering, Quantum, Randomness, Mathematics, Discrete mathematics, Quantum Physics, Kolmogorov complexity, Mathematics::History and Overview, Logic in Computer Science (cs.LO), Mathematics::Logic, 010201 computation theory & mathematics, symbols, 020201 artificial intelligence & image processing, Quantum Physics (quant-ph)

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::45b6d918adaace4ec6f5b8b84ac2033f
https://doi.org/10.1016/j.tcs.2021.05.017

المؤلفون: Oleg Verbitsky, Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler

المصدر: Journal of Computer and System Sciences. 113:42-59

مصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Discrete Mathematics (cs.DM), Computer Networks and Communications, Applied Mathematics, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), Graph similarity, Invariant (physics), Descriptive complexity theory, 01 natural sciences, Logic in Computer Science (cs.LO), Theoretical Computer Science, Combinatorics, Computer Science - Computational Complexity, Computational Theory and Mathematics, 010201 computation theory & mathematics, 020204 information systems, Graph isomorphism problem, 0202 electrical engineering, electronic engineering, information engineering, Equivalence relation, Graph property, Computer Science - Discrete Mathematics, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::acecb4c2c146fb1f2358445db01cc37f
https://doi.org/10.1016/j.jcss.2020.04.003

المؤلفون: Ghadeer Ghawadrah

المصدر: Fundamenta Mathematicae. 249:303-309

مصطلحات موضوعية: Algebra and Number Theory, Descriptive complexity theory, Topology, Topology (chemistry), Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::37aff3fe6228a42fa46ef9397bfd0ad3
https://doi.org/10.4064/fm758-8-2019

المؤلفون: Marek Szykuła, Robert Ferens

المصدر: Theoretical Computer Science. 787:14-27

مصطلحات موضوعية: Discrete mathematics, Class (computer programming), General Computer Science, Intersection (set theory), Computer science, Contrast (statistics), Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing), 0102 computer and information sciences, 02 engineering and technology, State (functional analysis), Star (graph theory), Descriptive complexity theory, 01 natural sciences, Theoretical Computer Science, State complexity, Regular language, 010201 computation theory & mathematics, Product (mathematics), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Boolean operations in computer-aided design, Alphabet, Computer Science::Formal Languages and Automata Theory

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::b7528d4109d6cde3ec101001a1db594e
https://doi.org/10.1016/j.tcs.2018.09.016

المؤلفون: Anuj Dawar, Simone Severini, Octavio Zapata

المساهمون: Dawar, Anuj [0000-0003-4014-8248], Apollo - University of Cambridge Repository

المصدر: Logic, Language, Information, and Computation ISBN: 9783662529201
WoLLIC

مصطلحات موضوعية: FOS: Computer and information sciences, Discrete mathematics, Computer Science - Logic in Computer Science, Class (set theory), Relation (database), Paley graph, Logic, 010102 general mathematics, Spectrum (functional analysis), Elementary equivalence, 0102 computer and information sciences, Descriptive complexity theory, 01 natural sciences, Logic in Computer Science (cs.LO), Combinatorics, Algebraic graph theory, 010201 computation theory & mathematics, Isomorphism, Adjacency matrix, 0101 mathematics, Algebraic number, Eigenvalues and eigenvectors, Mathematics

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

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6d22d0a5cce06d7f8a7fb21e5ad3586
https://doi.org/10.1016/j.apal.2019.04.005

المؤلفون: Adam Galambos

المصدر: Mathematical Social Sciences. 101:54-64

مصطلحات موضوعية: Computer Science::Computer Science and Game Theory, Finite model theory, Sociology and Political Science, General Social Sciences, Field (mathematics), State (functional analysis), Descriptive complexity theory, Connection (mathematics), symbols.namesake, Nash equilibrium, Revealed preference, symbols, Statistics, Probability and Uncertainty, Mathematical economics, General Psychology, Axiom, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::f90ec31555d2b81853a5a1a706ee0364
https://doi.org/10.1016/j.mathsocsci.2019.06.006

المؤلفون: Angelos Charalambidis, Panos Rondogiannis, Christos Nomikos

المصدر: Theory and Practice of Logic Programming. 19:925-940

مصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Class (set theory), Computer science, EXPTIME, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), Descriptive complexity theory, 01 natural sciences, Expressive power, Theoretical Computer Science, Datalog, Computer Science - Databases, Artificial Intelligence, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Order (group theory), computer.programming_language, Discrete mathematics, Computer Science - Programming Languages, InformationSystems_DATABASEMANAGEMENT, Databases (cs.DB), Logic in Computer Science (cs.LO), Computer Science - Computational Complexity, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computational Theory and Mathematics, 010201 computation theory & mathematics, Hardware and Architecture, computer, Software, Programming Languages (cs.PL)

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81aa1926d613bfbd5e77ecee58d4824e
https://doi.org/10.1017/s1471068419000279

المؤلفون: Joerg Flum, Yijia Chen

المصدر: Information and Computation. 267:116-134

مصطلحات موضوعية: Random graph, Conjecture, Computational complexity theory, Parameterized complexity, 0102 computer and information sciences, 02 engineering and technology, Descriptive complexity theory, 01 natural sciences, Upper and lower bounds, Computer Science Applications, Theoretical Computer Science, Combinatorics, Computational Theory and Mathematics, Clique problem, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Almost surely, Information Systems, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::cb95c94ebfa507ed0d4dee96ca35126a
https://doi.org/10.1016/j.ic.2019.03.008

المؤلفون: Fabio Gagliardi Cozman, Denis Deratani Mauá

المصدر: Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP

مصطلحات موضوعية: Finite model theory, Hierarchy (mathematics), Computer science, Applied Mathematics, Value (computer science), Bayesian network, Descriptive complexity theory, Theoretical Computer Science, Zero (linguistics), Artificial Intelligence, Abstract syntax, Law, Complexity class, LÓGICA MATEMÁTICA, Software

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b92164fe5ce86f32ef70fa5742b97490
https://doi.org/10.1016/j.ijar.2019.04.003

المؤلفون: Libor Barto, William DeMeo, Antoine Mottet

المصدر: LICS
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

مصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Property (philosophy), Computational complexity theory, Computer science, 0102 computer and information sciences, Computational Complexity (cs.CC), Descriptive complexity theory, 01 natural sciences, Simple (abstract algebra), FOS: Mathematics, 0101 mathematics, Algebraic number, Constraint satisfaction problem, 010102 general mathematics, F.1.3, F.4.1, Mathematics - Rings and Algebras, Logic in Computer Science (cs.LO), Algebra, Computer Science - Computational Complexity, Rings and Algebras (math.RA), 010201 computation theory & mathematics, Bounded function, Homomorphism

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bdaf7b606096d7ba1f742179a6665d40
https://doi.org/10.1109/lics52264.2021.9470670

المؤلفون: Petr A. Golovach, Fedor V. Fomin, Dimitrios M. Thilikos

المساهمون: Algorithmes, Graphes et Combinatoire (ALGCO), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Department of Informatics [Bergen] (UiB), University of Bergen (UiB)

المصدر: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2021, Rome, Italy. pp.1-13, ⟨10.1109/LICS52264.2021.9470540⟩
LICS

مصطلحات موضوعية: FOS: Computer and information sciences, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Computer Science - Logic in Computer Science, Discrete Mathematics (cs.DM), General Computer Science, Logic, Parameterized complexity, 0102 computer and information sciences, Descriptive complexity theory, Computational Complexity (cs.CC), [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Theoretical Computer Science, Combinatorics, Dominating set, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0101 mathematics, Graph property, Complement (set theory), Degree (graph theory), 010102 general mathematics, Logic in Computer Science (cs.LO), Computational Mathematics, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], Computer Science - Computational Complexity, 010201 computation theory & mathematics, Bounded function, Graph (abstract data type), Computer Science - Discrete Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ef2e7bcb4e73e98751ee4cf925dd243
http://arxiv.org/abs/2104.02998

المؤلفون: Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer

المساهمون: Department of Mathematics and Statistics

مصطلحات موضوعية: Arithmetic circuits, Finite model theory, Computer Networks and Communications, Structure (category theory), 0102 computer and information sciences, 02 engineering and technology, Descriptive complexity theory, Skolem normal form, 01 natural sciences, Theoretical Computer Science, #SAT, 0202 electrical engineering, electronic engineering, information engineering, 111 Mathematics, Skolem function, Counting classes, Mathematics, Discrete mathematics, Hierarchy (mathematics), Applied Mathematics, Function (mathematics), TIME, Computational Theory and Mathematics, 010201 computation theory & mathematics, Analytical hierarchy, 020201 artificial intelligence & image processing

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f81f16b2a12aa71f9a8164c5f0204f32
http://hdl.handle.net/10138/322725

المؤلفون: Max Bannach, Till Tantau

المصدر: Algorithms, Vol 14, Iss 96, p 96 (2021)
Algorithms
Volume 14
Issue 3

مصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theoretical computer science, lcsh:T55.4-60.8, Computer science, Parameterized complexity, Color-coding, 0102 computer and information sciences, Computational Complexity (cs.CC), Descriptive complexity theory, 01 natural sciences, lcsh:QA75.5-76.95, Theoretical Computer Science, color coding, Simple (abstract algebra), Quantifier elimination, lcsh:Industrial engineering. Management engineering, 0101 mathematics, Numerical Analysis, 000 Computer science, knowledge, general works, 010102 general mathematics, para-AC0, Logic in Computer Science (cs.LO), descriptive complexity, Computational Mathematics, Transfer (group theory), Computer Science - Computational Complexity, Computational Theory and Mathematics, quantifier elimination, 010201 computation theory & mathematics, fixed-parameter tractability, Path (graph theory), Computer Science, Embedding, lcsh:Electronic computers. Computer science

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

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73762f924b9e8fa61a68e19c307c665a
https://www.mdpi.com/1999-4893/14/3/96

المؤلفون: Heribert Vollmer, Timon Barlag

المصدر: Logic, Language, Information, and Computation ISBN: 9783030888527
WoLLIC

مصطلحات موضوعية: Discrete mathematics, Polynomial, Computation, Sense (electronics), Characterization (mathematics), Descriptive complexity theory, Constant (mathematics), Mathematics, Electronic circuit, Real number

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::d9c2586c683a4dc022dc8cab8b8b9956
https://doi.org/10.1007/978-3-030-88853-4_2