395 search results - page 5 / 79 » Positive Versions of Polynomial Time |
100
click to vote
SODA
1998
ACM
15 years 1 months ago
1998
ACM
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...
ECCC
2000
14 years 11 months ago
2000
A formula (in conjunctive normal form) is said to be minimal unsatisfiable if it is unsatisfiable and deleting any clause makes it satisfiable. The deficiency of a formula is the ...
DLT
2010
15 years 1 months ago
2010
Abstract. It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in...
94
Voted
FOCS
1992
IEEE
15 years 3 months ago
1992
IEEE
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
AIED
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We built three different versions of an ITS on a letter pattern extrapolation task: in one version, students only receive color-coded feedback; in the second, they receiv...