Sciweavers

1410 search results - page 206 / 282
» Proving theorems by reuse
Sort
View
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 8 months ago
Quantum interactive proofs with short messages
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The ...
Salman Beigi, Peter W. Shor, John Watrous
JCS
2010
112views more  JCS 2010»
13 years 8 months ago
Inductive trace properties for computational security
Protocol authentication properties are generally trace-based, meaning that authentication holds for the protocol if authentication holds for individual traces (runs of the protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
JELIA
2010
Springer
13 years 8 months ago
Parametrized Logic Programming
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...
Ricardo Gonçalves, José Júlio...
ACCESSNETS
2009
Springer
13 years 7 months ago
Capacity of Two-Way Relay Channel
This paper investigates the capacity of a wireless two-way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-th...
Shengli Zhang, Soung Chang Liew, Hui Wang, Xiao-Hu...
DM
2011
238views Education» more  DM 2011»
13 years 5 months ago
A combinatorial approach to height sequences in finite partially ordered sets
Fix an element x of a finite partially ordered set P on n elements. Then let hi(x) be the number of linear extensions of P in which x is in position i, counting from the bottom. T...
Csaba Biró, William T. Trotter