1450 search results - page 164 / 290 » On the Complexity of Hardness Amplification |
GCSE
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. A well-known problem in program generation is scoping. When identifiers (i.e., symbolic names) are used to refer to variables, types, or functions, program generators mu...
ICLP
1999
Springer
14 years 1 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
ICCL
1998
IEEE
14 years 1 months ago
1998
IEEE
On-line partial evaluators are hardly ever selfapplicable, because the complexity of deciding whether to residualize terms causes combinatorial explosion when self-application is ...
PPDP
1999
Springer
14 years 1 months ago
1999
Springer
For a compiler writer, generating good machine code for a variety of platforms is hard work. One might try to reuse a retargetable code generator, but code generators are complex a...
ALT
1997
Springer
14 years 1 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...