15 citations · 29 across the 9 of their papers we have counts for
9 papers
Succinct QUBO formulations for permutation problems by sorting networks
Katalin Friedl, Levente Gegő, László Kabódi +1
Quadratic Unconstrained Binary Optimization (QUBO) is a standard NP-hard optimization problem. Recently, it has gained renewed interest through quantum computing, as QUBOs directly…
Resident fitness computation in linear time and other algorithmic aspects of interacting trajectories
Katalin Friedl, Viktória Nemkin, András Tóbiás
Systems of interacting trajectories were recently studied in~\cite{HGSTW24}. Such a system of -valued piecewise linear trajectories arises as a scaling limit of the system o…
Quantum Inspired Adaptive Boosting
Bálint Daróczy, Katalin Friedl, László Kabódi +2
Building on the quantum ensemble based classifier algorithm of Schuld and Petruccione [arXiv:1704.02146v1], we devise equivalent classical algorithms which show that this quantum e…
Some Improvements to Total Degree Tests
Katalin Friedl, Madhu Sudan
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a low-degree polynomial. Each rule depends on the function's values…
When the largest eigenvalue of the modularity and normalized modularity matrix is zero
Marianna Bolla, Brian Bullins, Sorathan Chaturapruek +2
In July 2012, at the Conference on Applications of Graph Spectra in Computer Science, Barcelona, D. Stevanovic posed the following open problem: which graphs have the zero as the l…
Singular value decomposition of large random matrices (for two-way classification of microarrays)
Marianna Bolla, Katalin Friedl, Andras Kramli
Asymptotic behavior of the singular value decomposition (SVD) of blown up matrices and normalized blown up contingency tables exposed to Wigner-noise is investigated.It is proved t…