Sciweavers

5608 search results - page 182 / 1122
» On the Theory of Matchgate Computations
Sort
View
CORR
2007
Springer
136views Education» more  CORR 2007»
15 years 1 months ago
The analytic computability of the Shannon transform for a large class of random matrix channels
We define a class of “algebraic” random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate th...
N. Raj Rao
119
Voted
CSL
2010
Springer
15 years 2 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
COCOON
2003
Springer
15 years 7 months ago
The Complexity of Boolean Matrix Root Computation
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
Martin Kutz
ECAI
2006
Springer
15 years 5 months ago
A Logic-Based Framework to Compute Pareto Agreements in One-Shot Bilateral Negotiation
Abstract. We propose a logic-based approach to automated oneshot multi-issue bilateral negotiation. We use logic in two ways: (1) a logic theory to represent relations among issues...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
DICTA
2007
15 years 3 months ago
The Tower of Knowledge Scheme for Learning in Computer Vision
A scheme, named tower of knowledge (ToK), is proposed for interpreting 3D scenes. The ToK encapsulates causal dependencies between object appearance and functionality. We demonstr...
Maria Petrou, Mai Xu