Suchergebnisse - "Theory of computation → Complexity theory and logic"
-
1
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science. :1-14
Schlagwörter: Declassification, Computer Science - Logic in Computer Science, Type theory, Polynomial time, Basic Feasible Functionals, Theory of computation → Complexity theory and logic, [INFO] Computer Science [cs], Noninterference, Complexity analysis
Dateibeschreibung: application/pdf
-
2
Autoren:
Weitere Verfasser:
Schlagwörter: ddc:004, descriptive complexity, presburger arithmetic, DATA processing & computer science, completeness results, k-SUM, fine-grained complexity theory, Theory of computation → Complexity theory and logic
Dateibeschreibung: application/pdf
-
3
Autoren:
Weitere Verfasser:
Quelle: Proceedings of the ACM on Programming Languages. 7:806-832
Schlagwörter: CCS Concepts, Shape Analysis, Computational Complexity, Type theory, Logic and verification Polynomial time, CCS Concepts: Theory of computation → Complexity theory and logic Type theory Logic and verification Polynomial time, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Theory of computation → Complexity theory and logic, [INFO] Computer Science [cs], Noninterference, 01 natural sciences
Dateibeschreibung: application/pdf
-
4
Autoren:
Quelle: Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, February, Leibniz International Proceedings in Informatics : LIPIcs 326, 13:1-13:22 (2025). doi:10.4230/LIPIcs.CSL.2025.13 ; 33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz ; 33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz 33. EACSL Annual Conference on Computer Science Logic, CSL 2025, Amsterdam, Netherlands, 2025-02-10 - 2025-02-14
Schlagwörter: Mathematics of computing → Graph algorithms, Theory of computation → Complexity theory and logic, Theory of computation → Problems, reductions and completeness, Weisfeiler-Leman algorithm, coherent configurations, complexity, dimension
Geographisches Schlagwort: DE
Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-362-1; info:eu-repo/grantAgreement/EC//101054974
-
5
Autoren:
Weitere Verfasser:
Quelle: Saarbrücken/Wadern, Germany : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, June, Leibniz international proceedings in informatics 299, 16:1-16:18 (2024). doi:10.4230/LIPICS.FSCD.2024.16
9th International Conference on Formal Structures for Computation and Deduction : FSCD 2024, July 10-13, 2024, Tallinn, Estonia / edited by Jakob Rehof
9th International Conference on Formal Structures for Computation and Deduction : FSCD 2024, July 10-13, 2024, Tallinn, Estonia / edited by Jakob Rehof9. International Conference on Formal Structures for Computation and Deduction, FSCD 2024, Tallinn, Estonia, 2024-07-10-2024-07-13Schlagwörter: Proof rewriting, Rewriting, Theory of computation → Equational logic and rewriting, Confluence, Theory of computation → Automated reasoning, ddc:004, Theory of computation → Complexity theory and logic, Creating small terms, Description Logics, Derivational complexity, Termination
Dateibeschreibung: application/pdf
-
6
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Saarbrücken/Wadern, Germany : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, February, Leibniz International Proceedings in Informatics : LIPIcs 326, 13:1-13:22 (2025). doi:10.4230/LIPIcs.CSL.2025.13
33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz
33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz33. EACSL Annual Conference on Computer Science Logic, CSL 2025, Amsterdam, Netherlands, 2025-02-10-2025-02-14Schlagwörter: FOS: Computer and information sciences, Weisfeiler-Leman algorithm, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, Theory of computation → Problems, reductions and completeness, coherent configurations, Computational Complexity (cs.CC), Computer Science - Computational Complexity, dimension, ddc:004, Theory of computation → Complexity theory and logic, complexity, Computer Science - Discrete Mathematics
Dateibeschreibung: application/pdf
-
7
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Leibniz International Proceedings in Informatics ; CSL 2024 - 32nd EACSL Annual Conference on Computer Science Logic ; https://hal.science/hal-04777376 ; CSL 2024 - 32nd EACSL Annual Conference on Computer Science Logic, Feb 2024, Napoli, Italy. ⟨10.4230/LIPIcs.CSL.2024.10⟩
Schlagwörter: Implicit Computational Complexity, Theory of computation → Complexity theory and logic, Theory of computation → Proof theory, Theory of computation → Proof theory Bounded Arithmetic, Randomized Computation, Bounded Arithmetic, [INFO]Computer Science [cs]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2311.15003; info:eu-repo/grantAgreement//818616/EU/Differential Program Semantics/DIAPASoN; ARXIV: 2311.15003
-
8
Autoren: et al.
Schlagwörter: Computing methodologies → Artificial intelligence, Computing methodologies → Knowledge representation and reasoning, Information systems → Information integration, Theory of computation → Semantics and reasoning, Theory of computation → Complexity theory and logic, Knowledge representation and reasoning, Applications of logics, Formal logic, Declarative representations, Theory of computation → Logic
-
9
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Computer and information sciences, Implicit Computational Complexity, Bounded Arithmetic, Computational Complexity, Measure-Quantified Logics, BPP, Bounded Arithmetic, Mathematics - Logic, F.4.1, F.1.3, Randomized Computation, [INFO] Computer Science [cs], Logic in Computer Science (cs.LO), Theory of computation → Proof theory, Randomized Computation, BPP, Computational Complexity, FOS: Mathematics, Theory of computation → Proof theory Bounded Arithmetic, ddc:004, Theory of computation → Complexity theory and logic, Logic (math.LO)
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/2311.15003
https://hal.science/hal-04777376v1/document
https://doi.org/10.4230/lipics.csl.2024.10
https://hal.science/hal-04777376v1
http://hdl.handle.net/10138/570879
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.10
https://hdl.handle.net/11585/928635 -
10
Autoren: et al.
Weitere Verfasser: et al.
Quelle: MFCS 2023 ; https://hal.science/hal-04287405 ; MFCS 2023, Aug 2023, Bordeaux, France. ⟨10.4230/LIPIcs⟩
Schlagwörter: 2012 ACM Subject Classification Theory of computation → Complexity theory and logic, Theory of computation → Logic and verification, Theory of computation → Proof theory, Theory of computation → Program reasoning, finite multisets, termination, program verification, Well-partial order, [INFO]Computer Science [cs]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2302.09881; ARXIV: 2302.09881
-
11
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Leibniz International Proceedings in Informatics (LIPIcs) ; 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025) ; https://hal.science/hal-04931324 ; 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025), 2025, Amsterdam, Netherlands. ⟨10.4230/LIPIcs.CSL.2025.8⟩
Schlagwörter: monadic second-order definable concept learning, agnostic probably approximately correct learning, parameterized complexity, clique-width, fixed-parameter tractable, Boolean classification, supervised learning, monadic second-order logic, Theory of computation → Logic, Theory of computation → Complexity theory and logic, Theory of computation → Fixed parameter tractability, Computing methodologies → Logical and relational learning, Computing methodologies → Supervised learning, [INFO]Computer Science [cs]
Geographisches Schlagwort: Amsterdam, Netherlands
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1909.03820; ARXIV: 1909.03820
-
12
Autoren:
Weitere Verfasser:
Quelle: Computer Science Logic ; https://hal.science/hal-03374648 ; Computer Science Logic, Feb 2022, Göttingen, Germany. ⟨10.4230/LIPIcs.10⟩
Schlagwörter: 2012 ACM Subject Classification Theory of computation → Linear logic, Theory of computation → Complexity theory and logic phrases Implicit Complexity, Typing, Linear Logic, Functional Programming, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
-
13
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
https://hal.science/hal-03864946
25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022), Meel, Kuldeep S. and Strichman, Ofer, Aug 2022, Haifa, Israel. pp.17:1--17:20, ⟨10.4230/LIPIcs.SAT.2022.17⟩Schlagwörter: 2012 ACM Subject Classification Theory of computation → Complexity theory and logic, Theory of computation → Proof complexity phrases rectangle decision lists, QBF proof complexity, OBDD, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
-
14
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: FOS: Computer and information sciences, First-Order Logic, Mathematics - Logic, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, FOS: Mathematics, Promise Constraint Satisfaction Problem, Theory of computation → Complexity theory and logic, ddc:004, 0101 mathematics, Logic (math.LO), Model Checking Problem, Multi-Homomorphism
Dateibeschreibung: application/pdf
-
15
Autoren:
Quelle: Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 183, 10:1-10:18 (2021). doi:10.4230/LIPICS.CSL.2021.10 ; 29th EACSL Annual Conference on Computer Science Logic : CSL 2021, January 25-28, 2021, Ljubljana, Slovenia (virtual conference) / edited by Christel Baier, Jean Goubault-Larrecq ; 29th EACSL Annual Conference on Computer Science Logic : CSL 2021, January 25-28, 2021, Ljubljana, Slovenia (virtual conference) / edited by Christel Baier, Jean Goubault-Larrecq 29. EACSL Annual Conference on Computer Science Logic, CSL 2021, online, 2021-01-25 - 2021-01-28
Schlagwörter: Computing methodologies → Logical and relational learning, Computing methodologies → Supervised learning, Feferman-Vaught decomposition, Gaifman normal form, Theory of computation → Complexity theory and logic, Theory of computation → Logic, agnostic probably approximately correct learning, classification problems, first-order definable concept learning, first-order logic with counting, locality, weight aggregation logic
Geographisches Schlagwort: DE
Relation: info:eu-repo/semantics/altIdentifier/issn/1868-8969; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-175-7
-
16
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], 2012 ACM Subject Classification Theory of computation → Linear logic, Theory of computation → Complexity theory and logic phrases Implicit Complexity, Implicit Complexity, Functional Programming, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], ddc:004, Typing, Linear Logic
Dateibeschreibung: application/pdf
-
17
Autoren:
Weitere Verfasser:
-
18
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Leibniz International Proceedings in Informatics (LIPIcs) ; 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024) ; https://hal.science/hal-04784672 ; 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), Mar 2024, Clermont- Ferrand, France. ⟨10.4230/LIPIcs.STACS.2024.11⟩
Schlagwörter: Theory of computation → Complexity theory and logic, Theory of computation → Constraint and logic programming, DNNF, dichotomy, knowledge compilation, constraint satisfaction, [INFO]Computer Science [cs]
Geographisches Schlagwort: Clermont- Ferrand, France
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2311.10040; ARXIV: 2311.10040
-
19
Autoren:
Weitere Verfasser:
Quelle: Saarbrücken/Wadern, Germany : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 183, 10:1-10:18 (2021). doi:10.4230/LIPICS.CSL.2021.10
29th EACSL Annual Conference on Computer Science Logic : CSL 2021, January 25-28, 2021, Ljubljana, Slovenia (virtual conference) / edited by Christel Baier, Jean Goubault-Larrecq
29th EACSL Annual Conference on Computer Science Logic : CSL 2021, January 25-28, 2021, Ljubljana, Slovenia (virtual conference) / edited by Christel Baier, Jean Goubault-Larrecq29. EACSL Annual Conference on Computer Science Logic, CSL 2021, online, 2021-01-25-2021-01-28Schlagwörter: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Computer Science - Machine Learning, Computer Science - Artificial Intelligence, agnostic probably approximately correct learning, Computing methodologies → Logical and relational learning, 0102 computer and information sciences, 01 natural sciences, Gaifman normal form, Theory of computation → Logic, Logic in Computer Science (cs.LO), Machine Learning (cs.LG), locality, Artificial Intelligence (cs.AI), first-order definable concept learning, weight aggregation logic, first-order logic with counting, ddc:004, 0101 mathematics, Theory of computation → Complexity theory and logic, Feferman-Vaught decomposition, classification problems, Computing methodologies → Supervised learning
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/2009.10574
https://drops.dagstuhl.de/opus/volltexte/2021/13444/
https://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-10574
https://drops.dagstuhl.de/opus/volltexte/2021/13444/pdf/LIPIcs-CSL-2021-10.pdf/
http://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-10574
https://arxiv.org/abs/2009.10574
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2021.10
https://publications.rwth-aachen.de/record/815149 -
20
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Schlagwörter: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Constraint satisfaction problem, bounded width, Theory of computation → Problems, reductions and completeness, loop lemma, Mathematics - Logic, 0102 computer and information sciences, 01 natural sciences, Logic in Computer Science (cs.LO), near unanimity operation, local consistency, Theory of computation → Constraint and logic programming, FOS: Mathematics, Theory of computation → Complexity theory and logic, ddc:004, 0101 mathematics, constraint satisfaction problem, earunanimity operation, Logic (math.LO)
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/2005.00266
https://drops.dagstuhl.de/opus/volltexte/2020/12517/
https://drops.dagstuhl.de/opus/volltexte/2020/12517/pdf/LIPIcs-ICALP-2020-110.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2005.html#abs-2005-00266
https://doi.org/10.4230/LIPIcs.ICALP.2020.110
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.110
https://ruj.uj.edu.pl/xmlui/handle/item/252949
Nájsť tento článok vo Web of Science 
Full Text Finder