3208 search results - page 62 / 642 » A Lower Bound for Primality |
169
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
147
click to vote
IANDC
2006
15 years 5 months ago
2006
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
156
Voted
TOC
2008
15 years 5 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
154
click to vote
AIML
2004
15 years 7 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
158
click to vote
FOSSACS
2007
Springer
15 years 11 months ago
2007
Springer
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web serv...