4403 search results - page 169 / 881 » Galois Theory of Algorithms |
167
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
171
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
139
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...
201
click to vote
ICDCIT
2007
Springer
16 years 17 days ago
2007
Springer
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
157
click to vote
SPAA
2005
ACM
15 years 12 months ago
2005
ACM
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...