Searching for authors named "Ioannis Koutis" – sorted by Relevance.
7 documents found, showing 1 through 7.
-
On the Hardness of Approximate Multivariate Integration
- …We show that it is NP-hard to 2nk-approximate the integral of a positive, smooth, polynomialtime computable n-variate function, for any fixed integer k. 1…
- Cited by 1 (0 self) – Add To MetaCart
-
A faster parameterized algorithm for Set Packing
- …We present an efficient parameterized algorithm for the (k, t)-set packing problem, in which we are looking for a collection of k disjoint sets whose union consists of t elements. The complexity of the algorithm is O(2 O(t) nN log N). For the special case of sets of bounded size, this improves the O…
- Cited by 3 (1 self) – Add To MetaCart
-
Faster algebraic algorithms for path and packing problems
- …We study the problem of deciding whether an n-variate polynomial, presented as an arithmetic circuit G, contains a degree k square-free term with an odd coefficient. We show that if G can be evaluated over the integers modulo 2 k+1 in time t and space s, the problem can be decided with constant prob…
- Cited by 1 (0 self) – Add To MetaCart
-
Abstract A linear work, O(n 1/6) time, parallel algorithm for solving planar Laplacians ∗
- …We present a linear work parallel iterative algorithm for solving linear systems involving Laplacians of planar graphs. In particular, if Ax = b, where A is the Laplacian of any planar graph with n nodes, the algorithm produces a vector ¯x such that ||x − ¯x||A ≤ ɛ, in O(n 1/6+c log(1/ɛ)) parallel t…
- Cited by 2 (2 self) – Add To MetaCart
-
theory, computation and
- …Graph partitioning into isolated, high conductance clusters:…
- Add To MetaCart
-
Algorithms, Theory
- …We consider the problem of decomposing a weighted graph with n vertices into a collection P of vertex disjoint clusters such that, for all clusters C ∈ P, the graph induced by the vertices in C and the edges leaving C, has conductance bounded below by φ. We show that for planar graphs we can compute…
- Add To MetaCart
-
On the hardness of approximate multivariate integration Ioannis Koutis
- …We show that it is NP-hard to 2 -approximate the integral of a positive, smooth, polynomialtime computable n-variate function, for any fixed integer k. 1 …
- Add To MetaCart
Showing 1 through 7.
