Results 1 to 10 of about 23,779 (205)

Optimal Complexity of Parameterized Quantum Circuits [PDF]

Entropy
Parameterized quantum circuits are central to the development of variational quantum algorithms in the NISQ era. A key feature of these circuits is their ability to generate an expressive set of quantum states, enabling the approximation of solutions to ...
Guilherme I. Correr, Pedro C. Azado, Diogo O. Soares-Pinto, Gabriel G. Carlo   +3 more
doaj   +2 more sources

Parameterized Complexity of Equitable Coloring [PDF]

Discrete Mathematics & Theoretical Computer Science, 2019
A graph on $n$ vertices is equitably $k$-colorable if it is $k$-colorable and every color is used either $\left\lfloor n/k \right\rfloor$ or $\left\lceil n/k \right\rceil$ times.
Guilherme de C. M. Gomes, Carlos V. G. C. Lima, Vinícius F. dos Santos   +2 more
doaj   +5 more sources

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. [PDF]

Algorithmica
In this paper, we study the Eulerian Strong Component Arc Deletion problem, where the input is a directed multigraph and the goal is to delete the minimum number of arcs to ensure every strongly connected component of the resulting digraph is Eulerian.
Blažej V, Jana S, Ramanujan MS, Strulo P.   +3 more
europepmc   +2 more sources

On the parameterized complexity of the median and closest problems under some permutation metrics [PDF]

Algorithms for Molecular Biology
Genome rearrangements are events where large blocks of DNA exchange places during evolution. The analysis of these events is a promising tool for understanding evolutionary genomics, providing data for phylogenetic reconstruction based on genome ...
Luís Cunha, Ignasi Sau, Uéverton Souza
doaj   +2 more sources

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms

Algorithms, 2020
Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results.
Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi   +3 more
doaj   +3 more sources

Describing parameterized complexity classes

Information and Computation, 2003
We describe parameterized complexity classes by means of classical complexity theory and descriptive complexity theory. For every classical complexity class we introduce a parameterized analogue in a natural way. In particular, the analogue of polynomial
Flum, Jörg, Martin Grohe, Jörg Flum, Grohe, Martin   +3 more
core   +4 more sources

Parameterized parallel complexity [PDF]

, 1998
We introduce a framework to study the parallel complexity of parameterized problems, and we propose some analogs of ...
Cesati M., Di Ianni M.
core   +3 more sources

Parameterized Complexity of Streaming Diameter and Connectivity Problems [PDF]

, 2022
We initiate the investigation of the parameterized complexity of Diameter and Connectivity in the streaming paradigm. On the positive end, we show that knowing a vertex cover of size k allows for algorithms in the Adjacency List (AL) streaming model ...
van Leeuwen, Erik Jan, Oostveen, Jelle, Oostveen, Jelle J., Leeuwen, Erik Jan van   +3 more
core   +2 more sources

Parameterized Complexity of Scheduling Chains of Jobs with Delays [PDF]

, 2020
In this paper, we consider the parameterized complexity of the following scheduling problem. We must schedule a number of jobs on m machines, where each job has unit length, and the graph of precedence constraints consists of a set of chains.
Wegen, Marieke van der, van der Wegen, Marieke, Bodlaender, Hans L.   +2 more
core   +2 more sources

Parameterized Proof Complexity [PDF]

computational complexity, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider   +2 more
openaire   +2 more sources