344 search results - page 48 / 69 » Some Theorems We Should Prove |
MKM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Defining functions is a major topic when building mathematical repositories. Though relatively easy in mathematical vernacular, function definitions rise a number of qu...
104
click to vote
COCO
2010
Springer
15 years 1 months ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
IANDC
2010
14 years 8 months ago
2010
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
LATIN
2004
Springer
15 years 3 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...