1092 search results - page 171 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
LICS
2000
IEEE
15 years 6 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
135
click to vote
FOCS
1995
IEEE
15 years 5 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
119
click to vote
IPMI
2001
Springer
16 years 2 months ago
2001
Springer
Statistical analysis of anatomical shape differences between two different populations can be reduced to a classification problem, i.e., learning a classifier function for assignin...
131
click to vote
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...