13306 search results - page 305 / 2662 » Theoretical Computer Science |
194
click to vote
ICTCS
2005
Springer
16 years 5 days ago
2005
Springer
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...
186
click to vote
CAAP
1990
15 years 10 months ago
1990
One approach to give semantics to languages with subtypes is by translation to target languages without subtyping: subtypings A 6 B are interpreted via conversion functions A B. ...
170
click to vote
ICALP
2004
Springer
16 years 1 days 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, ...
164
click to vote
WG
2005
Springer
16 years 4 days ago
2005
Springer
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
132
click to vote
TCS
1998
15 years 6 months ago
1998
In this paper we present an alternative order-theoretic proof of the Banach fixed point theorem for selfmaps on complete metric spaces which is based on formal balls and, contrary...