3172 search results - page 477 / 635 » On the Random-Self-Reducibility of Complete Sets |
162
click to vote
IANDC
2006
15 years 6 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
183
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
230
click to vote
INFSOF
2006
15 years 6 months ago
2006
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing systems to be deployed on a variety of hardware and so...
174
click to vote
JALC
2006
15 years 6 months ago
2006
Minimal parallelism was recently introduced [3] as a way of using the rules of a P system: from each set of applicable rules associated to a membrane, at least one rule must be ap...
147
click to vote
JAPLL
2006
15 years 6 months ago
2006
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...