2446 search results - page 379 / 490 » Choiceless Polynomial Time |
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
Recent results regarding games with congestion-averse utilities (or, congestion-averse games—CAGs) have shown they possess some very desirable properties. Specifically, they hav...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
DFG
2009
Springer
14 years 2 months ago
2009
Springer
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...