Sciweavers

68 search results - page 10 / 14
» Three Tactic Theorem Proving
Sort
View
CORR
2008
Springer
71views Education» more  CORR 2008»
13 years 11 months ago
Asteroids in rooted and directed path graphs
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
Kathie Cameron, Chính T. Hoàng, Benj...
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 9 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
NETWORKS
2011
13 years 1 months ago
On terminal delta-wye reducibility of planar graphs
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
Isidoro Gitler, Feliu Sagols
ATAL
2005
Springer
14 years 4 months ago
Towards a formal framework for the search of a consensus between autonomous agents
This paper aims at proposing a general formal framework for dialogue between autonomous agents which are looking for a common agreement about a collective choice. The proposed set...
Leila Amgoud, Sihem Belabbes, Henri Prade
RECOMB
2007
Springer
14 years 11 months ago
Beyond Galled Trees - Decomposition and Computation of Galled Networks
Reticulate networks are a type of phylogenetic network that are used to represent reticulate evolution involving hybridization, horizontal gene transfer or recombination. The simpl...
Daniel H. Huson, Tobias H. Klöpper