Sciweavers

473 search results - page 7 / 95
» Computing excluded minors
Sort
View
IACR
2011
127views more  IACR 2011»
12 years 7 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
BIRTHDAY
2010
Springer
13 years 8 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
GC
2007
Springer
13 years 7 months ago
Some Recent Progress and Applications in Graph Minor Theory
Ken-ichi Kawarabayashi, Bojan Mohar
GC
2010
Springer
13 years 6 months ago
K6-Minors in Triangulations on the Nonorientable Surface of Genus 3
Raiji Mukae, Atsuhiro Nakamoto, Yoshiaki Oda, Yusu...