Results 41 to 50 of about 2,051,541 (361)
Improving Vertex Cover as a Graph Parameter [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In this context, vertex cover is used as a powerful parameter for dealing with graph problems which are hard to solve even when parameterized by tree-width; however,
Robert Ganian
doaj +1 more source
Parameterized Complexity of Gerrymandering
, 2023 In a representative democracy, the electoral process involves partitioning geographical space into districts which each elect a single representative. These representatives craft and vote on legislation, incentivizing political parties to win as many districts as possible (ideally a plurality). Gerrymandering is the process by which district boundaries
Andrew Fraser +2 more
openaire +2 more sources
Parameterized learning complexity [PDF]
Proceedings of the sixth annual conference on Computational learning theory - COLT '93, 1993 We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using parameterized problem reducibilities, we show that P -sized DNF (CNF) formulas can be exactly learned in time polynomial in the number of variables by extended equivalence queries ...
Rodney G. Downey +2 more
openaire +1 more source
Quantum Parameterized Complexity
, 2022 23 pages, 1 ...
Bremner, Michael J. +5 more
openaire +2 more sources
Taming the Chaos in Neural Network Time Series Predictions
Entropy, 2021 Machine learning methods, such as Long Short-Term Memory (LSTM) neural networks can predict real-life time series data. Here, we present a new approach to predict time series data combining interpolation techniques, randomly parameterized LSTM neural ...
Sebastian Raubitzek, Thomas Neubauer
doaj +1 more source
, 2015 In resolving instances of a computational problem, if multiple instances of interest share a feature in common, it may be fruitful to compile this feature into a format that allows for more efficient resolution, even if the compilation is relatively ...
Chen, Hubie
core +2 more sources
A Brief Survey of Fixed-Parameter Parallelism
Algorithms, 2020 This paper provides an overview of the field of parameterized parallel complexity by surveying previous work in addition to presenting a few new observations and exploring potential new directions.
Faisal N. Abu-Khzam, Karam Al Kontar
doaj +1 more source
Is FFT Fast Enough for Beyond 5G Communications? A Throughput-Complexity Analysis for OFDM Signals
IEEE Access, 2022 In this paper, we study the impact of computational complexity on the throughput limits of the fast Fourier transform (FFT) algorithm for orthogonal frequency division multiplexing (OFDM) waveforms.
Saulo Queiroz +2 more
doaj +1 more source
Parameterized Complexity of Edge Interdiction Problems [PDF]
, 2014 We study the parameterized complexity of interdiction problems in graphs. For an optimization problem on graphs, one can formulate an interdiction problem as a game consisting of two players, namely, an interdictor and an evader, who compete on an ...
Guo, Jiong, Shrestha, Yash Raj
core +1 more source
Computation Models for Parameterized Complexity [PDF]
Mathematical Logic Quarterly, 1997 AbstractA parameterized computational problem is a set of pairs (x,k), wherekis a distinguished item called “parameter”. FPT is the class of fixed‐parameter tractable problems: for any fixed value ofk, they are solvable in time bounded by a polynomial of degree α, where α is a constant not dependent on the parameter. In order to deal with parameterized
Cesati M., Di Ianni M.
openaire +2 more sources