213 search results - page 43 / 43 » A framework for checking proofs naturally |
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
FOIKS
2008
Springer
13 years 6 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
CCE
2011
12 years 11 months ago
2011
The robustness of a system is a property that pervades all aspects of Nature. The ability of a system to adapt itself to perturbations due to internal and external agents, to agin...