28888 search results - page 388 / 5778 » Computability and complexity in analysis |
145
click to vote
ASSETS
2004
ACM
16 years 7 days ago
2004
ACM
Using Internet Archive’s Wayback Machine, a random sample of websites from 1997-2002 were retrospectively analyzed for effects that technology has on accessibility for persons w...
175
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
166
click to vote
AMAST
2006
Springer
15 years 10 months ago
2006
Springer
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
196
click to vote
AUTONOMICS
2008
ACM
15 years 8 months ago
2008
ACM
A goal of computing and networking systems is to limit administrative requirements for users and operators. A technical systems should be able to configure itself as much as possi...
164
click to vote
CIE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quic...