Home /Research /Continuous alternation: The complexity of pursuit in continuous domains
OTHER

Continuous alternation: The complexity of pursuit in continuous domains

John H. Reif, Stephen R. Tate

Year
1993
Citations
9

Keywords

Alternation (linguistics)Differential gameComputer scienceBounded functionMathematicsDifferential (mechanical device)Upper and lower boundsTheory of computationComplexity classOptimal control

Related papers

Browse all OTHER papers