Sciweavers

1199 search results - page 110 / 240
» Parameterized Proof Complexity
Sort
View
SIAMCO
2008
130views more  SIAMCO 2008»
13 years 10 months ago
Important Moments in Systems and Control
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...
Christopher I. Byrnes, Anders Lindquist
IPL
2010
119views more  IPL 2010»
13 years 8 months ago
Note on Max Lin-2 above Average
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 ...
Robert Crowston, Gregory Gutin, Mark Jones
COCO
2010
Springer
129views Algorithms» more  COCO 2010»
14 years 1 months ago
On the Relative Strength of Pebbling and Resolution
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...
Jakob Nordström
CRYPTO
2001
Springer
139views Cryptology» more  CRYPTO 2001»
14 years 2 months ago
Soundness in the Public-Key Model
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...
Silvio Micali, Leonid Reyzin
SGP
2004
14 years 12 days ago
Persistence Barcodes for Shapes
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...
Gunnar Carlsson, Afra Zomorodian, Anne D. Collins,...