315 search results - page 20 / 63 » Cell-probe lower bounds for the partial match problem |
TCS
2008
13 years 7 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
MFCS
2010
Springer
13 years 5 months ago
2010
Springer
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
STOC
1997
ACM
13 years 11 months ago
1997
ACM
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...