6274 search results - page 18 / 1255 » Proofs, Programs, Processes |
JFLP
2002
13 years 7 months ago
2002
We consider prescriptive type systems for logic programs (as in G
STACS
2001
Springer
14 years 3 days ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
ICIP
2001
IEEE
14 years 9 months ago
2001
IEEE
An elementary proof of a basic uncertainty principle concerning pairs of representations of ?? vectors in different orthonormal bases is provided. The result, slightly stronger th...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...