1199 search results - page 110 / 240 » Parameterized Proof Complexity |
132
click to vote
SIAMCO
2008
15 years 2 months ago
2008
The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence on the...
137
Voted
IPL
2010
15 years 1 months ago
2010
In the Max Lin-2 problem we are given a system S of m linear equations in n variables over F2 in which Equation j is assigned a positive integral weight wj for each j. We wish to ...
126
click to vote
COCO
2010
Springer
15 years 6 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
CRYPTO
2001
Springer
15 years 7 months ago
2001
Springer
The public-key model for interactive proofs has proved to be quite effective in improving protocol efficiency [CGGM00]. We argue, however, that its soundness notion is more subtle...
128
click to vote
SGP
2004
15 years 5 months ago
2004
In this paper, we initiate a study of shape description and classification via the application of persistent homology to tangential constructions on geometric objects. Our techniq...