6 citations · 13 across the 8 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2023
On the Complexity of the Median and Closest Permutation Problems
Luís Cunha, Ignasi Sau, Uéverton Souza
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 genomic…
cs.CC2023★ 1 cited
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
Karthik C. S., Dániel Marx, Marcin Pilipczuk +1
Assuming the Exponential Time Hypothesis (ETH), a result of Marx (ToC'10) implies that there is no time algorithm that can solve 2-CSPs with constra…
cs.CC2012
Revisiting the Complexity of And/Or Graph Solution
Maise Dantas da Silva, Fábio Protti, Uéverton dos Santos Souza
This paper presents a study on two data structures that have been used to model several problems in computer science: and/or graphs and x-y graphs. An and/or graph is an acyclic di…