1717 search results - page 64 / 344 » A Computable Spectral Theorem |
155
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...
127
click to vote
STOC
1995
ACM
15 years 7 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
156
click to vote
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
113
click to vote
APAL
1998
15 years 3 months ago
1998
We investigate the relationship of (jumps of) the degrees of splittings of a computably enumerable set and the degree of the set. We prove that there is a high computably enumerab...
145
click to vote
ECML
2004
Springer
15 years 9 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...