2095 search results - page 97 / 419 » Improved pebbling bounds |
108
Voted
JAIR
2010
14 years 11 months ago
2010
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
86
Voted
FOCS
1993
IEEE
15 years 4 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
106
click to vote
TAMC
2007
Springer
15 years 6 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
97
Voted
CC
2007
Springer
15 years 23 days ago
2007
Springer
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...