159 search results - page 6 / 32 » Soft lambda-Calculus: A Language for Polynomial Time Computa... |
115
click to vote
CASES
2004
ACM
15 years 2 months ago
2004
ACM
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
95
Voted
IANDC
2007
14 years 9 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
COCOON
1999
Springer
15 years 1 months ago
1999
Springer
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
CP
2004
Springer
15 years 2 months ago
2004
Springer
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
IJCAI
1993
14 years 10 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...