292 search results - page 20 / 59 » A linearization of the Lambda-calculus and consequences |
128
click to vote
JACM
2006
15 years 1 months ago
2006
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
117
click to vote
DAM
2007
15 years 1 months ago
2007
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...
COMBINATORICS
1999
15 years 1 months ago
1999
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
152
click to vote
LICS
2012
IEEE
13 years 3 months ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
We investigate algebraic, logical, and geometric properties of concepts recognized by various classes of probabilistic classifiers. For this we introduce a natural hierarchy of pr...