Arrow Research search
Back to Highlights

Highlights 2021

Parameterized Distributed Complexity Theory: A logical approach

Conference Abstract SESSION 18A: Concurrency Logic in Computer Science ยท Theoretical Computer Science

Abstract

Parameterized complexity theory offers a framework for a refined analysis of hard algorithmic problems. In this work we follow the approach of parameterized complexity to provide a framework of parameterized distributed complexity.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Highlights of Logic, Games and Automata
Archive span
2013-2025
Indexed papers
1236
Paper id
856649854089895975