8512 search results - page 223 / 1703 » Computing Theory With Relevance |
116
click to vote
CSL
2007
Springer
15 years 11 months ago
2007
Springer
Existing definitions of the relativizations of NC1 , L and NL do not preserve the inclusions NC1 ⊆ L, NL ⊆ AC1 . We start by giving the first definitions that preserve them....
132
Voted
ICALP
1997
Springer
15 years 9 months ago
1997
Springer
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
130
click to vote
ECSCW
2003
15 years 6 months ago
2003
The constructs of "common ground" and "grounding" are frequently invoked in the CSCW literature as a mechanism by which participants engaged in joint activity c...
129
Voted
CIE
2005
Springer
15 years 10 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
170
click to vote
MFCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....