148 search results - page 23 / 30 » An Algebraic Theory of Graph Reduction |
111
click to vote
STOC
2004
ACM
16 years 1 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
110
click to vote
EUROCOLT
1995
Springer
15 years 5 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
115
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
102
click to vote
STOC
2002
ACM
16 years 1 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, ...
134
click to vote
AUTOMATICA
2008
15 years 1 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...