96 search results - page 15 / 20 » A lower bound for intuitionistic logic |
182
Voted
TMC
2012
13 years 4 months ago
2012
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
122
click to vote
LATIN
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
101
Voted
STOC
2001
ACM
16 years 2 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
DATE
2004
IEEE
15 years 5 months ago
2004
IEEE
We show how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts. In analogy to librar...
109
click to vote
CCA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...