Lectures related to Binary Numbers: Representation and Complexity

Explores number representation, algorithms, recursion, and probabilities in decimal and binary.

Number Systems: Fixed and Floating-Point Representations

Discusses fixed-point and floating-point representations in digital systems, covering key concepts like precision, accuracy, and the IEEE 754 standard.

Information Representation: conventions and basics

Covers information representation, including universal representation, symbol and number representation, and the significance of the binary system.

Untitled

Number Systems: Fixed and Floating-Point Representations

Provides an overview of fixed-point and floating-point number representations in digital systems.

Algorithmic Complexity: Travel Time Analysis

Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.

Graph Coloring: Random vs Symmetrical

Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.

Nonlinear Equations: Representation of Real Numbers

Discusses the representation of real numbers in various bases and the implications of floating-point arithmetic.

Untitled

Transition to Smart Cities: Complexity and Interdependencies

Delves into the complexity and interdependencies of transitioning to smart cities, emphasizing the importance of a holistic approach.

Algorithmic Complexity: Definition and Examples

Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.

Simon Problem 4: Quantum State and Complexity Analysis

Explores the Simon Problem 4, analyzing quantum states and algorithm complexity.

Untitled

Linear Systems: Convergence and Methods

Explores linear systems, convergence, and solving methods with a focus on CPU time and memory requirements.

Elements of computational complexity

Covers classical and quantum computational complexity concepts and implications.

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Improved Algorithm: Three-Color Parity Games

Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.

Graph Coloring: Theory and Applications

Covers the theory and applications of graph coloring, focusing on disassortative stochastic block models and planted coloring.

Logic Systems: Representations and Arithmetic

Explores representations, arithmetic, and limitations in logic systems, including place-value notation and binary arithmetic.