The paper defines prompting complexity as the length of the shortest plausible prompt that deterministically generates a target text with a fixed language model.
GenDLN: Evolutionary Algorithm-Based Stacked LLM Framework for Joint Prompt Optimization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Prompting Complexity: Shortest Prompts for Texts and Behaviors in LLMs
The paper defines prompting complexity as the length of the shortest plausible prompt that deterministically generates a target text with a fixed language model.