STOC
2010
ACM
14 years 7 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
STOC
2010
ACM
14 years 7 months ago
2010
ACM
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
STOC
2010
ACM
14 years 7 months ago
2010
ACM
STOC
2010
ACM
14 years 7 months ago
2010
ACM
In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the foll...
0
posts
with
0
views
0
views
Graduated in Information Science in 2007 from GIT-Belgaum (India). Worked on Graph Theory (Matching Algorithm), Ad-Hoc Network algorithms and Ant Colony Optimization (Swarm Intelli...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
STOC
2001
ACM
14 years 10 months ago
2001
ACM
STOC
2001
ACM
14 years 10 months ago
2001
ACM
STOC
2001
ACM
14 years 10 months ago
2001
ACM
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...