922 search results - page 64 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
122
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
180
click to vote
COCO
2009
Springer
16 years 26 days ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
183
click to vote
POPL
2012
ACM
14 years 1 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
210
click to vote
PLDI
2012
ACM
13 years 8 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
204
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...