1688 search results - page 56 / 338 » The Complexity of Rationalizing Matchings |
161
click to vote
COCOON
2008
Springer
15 years 7 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
141
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
159
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
143
click to vote
COMPGEOM
2007
ACM
15 years 9 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
153
click to vote
IJCAI
2007
15 years 7 months ago
2007
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...