Search Results - "Randomised AND approximation algorithms*"

Parameterised counting complexity theory.

Authors: Roth, Marc¹ (AUTHOR) m.roth@qmul.ac.uk

Source: Computer Science Review. Feb2026, Vol. 59, pN.PAG-N.PAG. 1p.

Randomised subspace system identification: complexities and error bounds.

Authors: Kedia, Vatsal Chakraborty, Debraj

Source: International Journal of Control; Dec2025, Vol. 98 Issue 12, p2835-2846, 12p

Subject Terms: COMPUTATIONAL complexity, SUBSPACE identification (Mathematics), EMPIRICAL research, SYSTEM identification, LINEAR time invariant systems, STANDARD deviations

The Complexity of Flood Filling Games.

Authors: Arthur, David Clifford, Raphaël Jalsenius, Markus et al.

Source: Fun with Algorithms (9783642131219); 2010, p307-318, 12p

On applications of the ray-shooting method for structured and structured-sparse static-output-feedbacks.

Authors: Peretz, Y.

Source: International Journal of Systems Science; Jul2017, Vol. 48 Issue 9, p1902-1913, 12p

Subject Terms: STATICS, FEEDBACK control systems, CONTINUOUS functions, PROBABILITY theory, CONTINUOUS-time filters

Fun with Algorithms : 5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010, Proceedings

Authors: Paolo Boldi Luisa Gargano

Resource Type: eBook.

Subjects: Computer programming, Computer networks, Computer science, Algorithms, Computer science—Mathematics, Discrete mathematics, Artificial intelligence

Categories: COMPUTERS / Programming / General, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Computer Science, COMPUTERS / Networking / General, COMPUTERS / Programming / Algorithms, MATHEMATICS / Discrete Mathematics