Výsledky vyhledávání - "Fixed-parameter algorithms and complexity"

Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis

Autoři: Guruswami, Venkatesan Lin, Bingkai Ren, Xuandi a další

Témata: Applied Mathematics, Mathematical Sciences, Fixed-parameter algorithms and complexity, Hardness of approximations, PCP theorems

Přístupová URL adresa: https://escholarship.org/uc/item/1j64r6k1

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials

Autoři: Komarath, Balagopal Pandey, Anurag Rahul, Chengot Sankaramenon a další

Přispěvatelé: Komarath, Balagopal Pandey, Anurag Rahul, Chengot Sankaramenon a další

Zdroj: Algorithmica. 85:2554-2579

Témata: Algebraic complexity, Fixed-parameter algorithms and complexity, Treewidth, Graph homomorphisms, Fine-grained complexity, Algebraic circuits, Homomorphism polynomials, Pathwidth, Monotone complexity, Treedepth, Algebraic branching programs, Algebraic formulas, ddc:004, Graph algorithms

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.83

Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures

Autoři: Pilipczuk, Michał Schirrmacher, Nicole Siebertz, Sebastian a další

Přispěvatelé: Pilipczuk, Michał Schirrmacher, Nicole Siebertz, Sebastian a další

Témata: Combinatorics and graph theory, Computational applications of logic, Data structures, Fixed-parameter algorithms and complexity, Graph algorithms

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.102

Dostupnost: https://doi.org/10.4230/LIPIcs.ICALP.2022.102
https://nbn-resolving.org/urn:nbn:de:0030-drops-164432
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.102

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials

Autoři: Komarath, Balagopal Pandey, Anurag Rahul, Chengot Sankaramenon a další

Přispěvatelé: Komarath, Balagopal Pandey, Anurag Rahul, Chengot Sankaramenon a další

Témata: Homomorphism polynomials, Monotone complexity, Algebraic complexity, Graph algorithms, Fine-grained complexity, Fixed-parameter algorithms and complexity, Treewidth, Pathwidth, Treedepth, Graph homomorphisms, Algebraic circuits, Algebraic branching programs, Algebraic formulas

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.83

Dostupnost: https://doi.org/10.4230/LIPIcs.ICALP.2022.83
https://nbn-resolving.org/urn:nbn:de:0030-drops-164245
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.83

Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures

Autoři: Pilipczuk, Michał Schirrmacher, Nicole Siebertz, Sebastian a další

Přispěvatelé: Pilipczuk, Michał Schirrmacher, Nicole Siebertz, Sebastian a další

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Data structures, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, Fixed-parameter algorithms and complexity, Mathematics - Logic, 0102 computer and information sciences, Theory of computation → Finite Model Theory, 01 natural sciences, Logic in Computer Science (cs.LO), Theory of computation → Fixed parameter tractability, Computational applications of logic, Computer Science - Data Structures and Algorithms, Combinatorics and graph theory, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Logic (math.LO), Graph algorithms, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2111.03725
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.102

Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures

Autoři: Pilipczuk, Micha? Schirrmacher, Nicole Siebertz, Sebastian a další

Témata: Combinatorics and graph theory, Computational applications of logic, Data structures, Fixed-parameter algorithms and complexity, Graph algorithms, Data processing Computer science, InProceedings, publishedVersion