Sciweavers

1469 search results - page 33 / 294
» Approximate polynomial decomposition
Sort
View
109
Voted
STOC
1989
ACM
66views Algorithms» more  STOC 1989»
15 years 9 months ago
The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial
Leonard Pitt, Manfred K. Warmuth
96
Voted
DAGSTUHL
2006
15 years 6 months ago
Local Minimax Learning of Approximately Polynomial Functions
Lee Jones, Konstantin A. Rybnikov
161
Voted
SODA
1998
ACM
128views Algorithms» more  SODA 1998»
15 years 6 months ago
A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
Sanjeev Arora, Michelangelo Grigni, David R. Karge...