Related papers: The Complexity of Subelection Isomorphism Problems
Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…
Mapping political party systems to metric policy spaces is one of the major methodological problems in political science. At present, in most political science project this task is performed by domain experts relying on purely qualitative…
Co-clustering, that is, partitioning a numerical matrix into homogeneous submatrices, has many applications ranging from bioinformatics to election analysis. Many interesting variants of co-clustering are NP-hard. We focus on the basic…
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating together preferences of multiple agents. We study here the…
Predicting the winner of an election is a favorite problem both for news media pundits and computational social choice theorists. Since it is often infeasible to elicit the preferences of all the voters in a typical prediction scenario, a…
Primarily this paper presents an expository report on alternatives to the traditional methods of classifying representations of finite dimensional algebras. Some new results illustrating such alternatives for algebras with only finitely…
We study the parameterized complexity of counting variants of Swap- and Shift-Bribery problems, focusing on the parameterizations by the number of swaps and the number of voters. We show experimentally that Swap-Bribery offers a new…
In recent years there has been a rapid increase in classification methods on graph structured data. Both in graph kernels and graph neural networks, one of the implicit assumptions of successful state-of-the-art models was that…
In this paper we give a short overview about the Ball-Evans approximation problem, i.e. about the approximation of Sobolev homeomorphism by a sequence of diffeomorphisms (or piecewise affine homeomorphisms) and we recall the motivation for…
The Coalitional Manipulation (CM) problem has been studied extensively in the literature for many voting rules. The CM problem, however, has been studied only in the complete information setting, that is, when the manipulators know the…
The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide…
In this paper, we give algorithms for determining the existence of isomorphism between two finite-dimensional Lie algebras and compute such an isomorphism in the affirrmative case. We also provide algorithms for determining algebraic…
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voters a specified candidate can be made the election's winner? We…
When applying optimization method to a real-world problem, the possession of prior knowledge and preliminary analysis on the landscape of a global optimization problem can give us an insight into the complexity of the problem. This…
Subgraph isomorphism counting is known as #P-complete and requires exponential time to find the accurate solution. Utilizing representation learning has been shown as a promising direction to represent substructures and approximate the…
We study multivariate problems like function approximation, numerical integration, global optimization and dispersion. We obtain new results on the information complexity $n(\varepsilon,d)$ of these problems. The information complexity is…
Topological data analysis is becoming increasingly relevant to support the analysis of unstructured data sets. A common assumption in data analysis is that the data set is a sample---not necessarily a uniform one---of some high-dimensional…
We study the complexity of holomorphic isometries and proper maps from the complex unit ball to type IV classical domains. We investigate on degree estimates of holomorphic isometries and holomorphic maps with minimum target dimension. We…
In multiple-question referendum elections, the separability problem occurs when a voter's preferences on some questions or proposals depend on the predicted outcomes of others. The notion of separability formalizes the study of…
Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between…