Polynomial-time problems

Element distinctness problem

In computational complexity theory, the element distinctness problem or element uniqueness problem is the problem of determining whether all the elements of a list are distinct. It is a well studied problem in many different models of computation. The problem may be solved by sorting the list and then checking if there are any consecutive equal elements; it may also be solved in linear expected time by a randomized algorithm that inserts each item into a hash table and compares only those elements that are placed in the same hash table cell. Several lower bounds in computational complexity are proved by reducing the element distinctness problem to the problem in question, i.e., by demonstrating that the solution of the element uniqueness problem may be quickly found after solving the problem in question. (Wikipedia).

Video thumbnail

Multivariable chain rule and differentiability

Free ebook http://tinyurl.com/EngMathYT A lecture on the chain rule and differentiability of functions of two (or more) variables. Many examples are discussed and solved.

From playlist Engineering Mathematics

Video thumbnail

Learn to determine the points where a function is non differentiable

👉 Learn how to determine the differentiability of a function. A function is said to be differentiable if the derivative exists at each point in its domain. To check the differentiability of a function, we first check that the function is continuous at every point in the domain. A function

From playlist Find the Differentiability of a Function

Video thumbnail

Learn to find the value that makes the piecewise function differentiable and continuous

👉 Learn how to determine the differentiability of a function. A function is said to be differentiable if the derivative exists at each point in its domain. To check the differentiability of a function, we first check that the function is continuous at every point in the domain. A function

From playlist Find the Differentiability of a Function

Video thumbnail

How to determine the points that make the function differentiable

👉 Learn how to determine the differentiability of a function. A function is said to be differentiable if the derivative exists at each point in its domain. To check the differentiability of a function, we first check that the function is continuous at every point in the domain. A function

From playlist Find the Differentiability of a Function

Video thumbnail

How to determine the points of differentiability

👉 Learn how to determine the differentiability of a function. A function is said to be differentiable if the derivative exists at each point in its domain. To check the differentiability of a function, we first check that the function is continuous at every point in the domain. A function

From playlist Find the Differentiability of a Function

Video thumbnail

C49 Example problem solving a system of linear DEs Part 1

Solving an example problem of a system of linear differential equations, where one of the equations is not homogeneous. It's a long problem, so this is only part 1.

From playlist Differential Equations

Video thumbnail

If a function is differentiable then it is continuous

👉 Learn how to determine the differentiability of a function. A function is said to be differentiable if the derivative exists at each point in its domain. To check the differentiability of a function, we first check that the function is continuous at every point in the domain. A function

From playlist Find the Differentiability of a Function

Video thumbnail

Learn how to determine if a piecewise function is continuous and differentiable

👉 Learn how to determine the differentiability of a function. A function is said to be differentiable if the derivative exists at each point in its domain. To check the differentiability of a function, we first check that the function is continuous at every point in the domain. A function

From playlist Find the Differentiability of a Function

Video thumbnail

Learn how to determine if a function is continuous and differentiable piecewise

👉 Learn how to determine the differentiability of a function. A function is said to be differentiable if the derivative exists at each point in its domain. To check the differentiability of a function, we first check that the function is continuous at every point in the domain. A function

From playlist Find the Differentiability of a Function

Video thumbnail

Nexus Trimester - Arkadev Chattopadhyay (TIFR)

Topology matters in communication Arkadev Chattopadhyay February 11, 2016 Abstract: We study communication cost of computing functions when inputs are distributed among k processors, each of which is located at one vertex of a network/graph called a terminal. Every other node of the netwo

From playlist Nexus Trimester - 2016 - Distributed Computation and Communication Theme

Video thumbnail

Set - Based and Weighted Zero Sum Problems by W. Schmid

Program Workshop on Additive Combinatorics ORGANIZERS: S. D. Adhikari and D. S. Ramana DATE: 24 February 2020 to 06 March 2020 VENUE: Madhava Lecture Hall, ICTS Bangalore Additive combinatorics is an active branch of mathematics that interfaces with combinatorics, number theory, ergod

From playlist Workshop on Additive Combinatorics 2020

Video thumbnail

Live CEOing Ep 235: Language Design in Wolfram Language

Watch Stephen Wolfram and teams of developers in a live, working, language design meeting. This episode is about Language Design in the Wolfram Language.

From playlist Behind the Scenes in Real-Life Software Design

Video thumbnail

How Big are All Infinities Combined? (Cantor's Paradox) | Infinite Series

Viewers like you help make PBS (Thank you 😃) . Support your local PBS Member Station here: https://to.pbs.org/donateinfi Infinities come in different sizes. There’s a whole tower of progressively larger "sizes of infinity". So what’s the right way to describe the size of the whole tower?

From playlist An Infinite Playlist

Video thumbnail

CSE373 2012 - Lecture 11 - Graph Data Structures

This is Lecture 11 of the CSE373 (Analysis of Algorithms) course taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 2012.

From playlist CSE373 - Analysis of Algorithms - 2012 SBU

Video thumbnail

Additive Number Theory: Extremal Problems and the Combinatorics.... (Lecture 1) by M. Nathanson

Program Workshop on Additive Combinatorics ORGANIZERS: S. D. Adhikari and D. S. Ramana DATE: 24 February 2020 to 06 March 2020 VENUE: Madhava Lecture Hall, ICTS Bangalore Additive combinatorics is an active branch of mathematics that interfaces with combinatorics, number theory, ergod

From playlist Workshop on Additive Combinatorics 2020

Video thumbnail

4. Forbidding a subgraph III: algebraic constructions

MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX How does one construct graphs that do not contain complet

From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019

Video thumbnail

30: Small-scale oscillations -- Part 2

Jacob Linder: 29.02.2012, Classical Mechanics (TFY4345), v2012 NTNU A full textbook covering the material in the lectures in detail can be downloaded for free here: http://bookboon.com/en/introduction-to-lagrangian-hamiltonian-mechanics-ebook

From playlist NTNU: TFY 4345 - Classical Mechanics | CosmoLearning Physics

Video thumbnail

Find the values a and b that make the function differentiable

👉 Learn how to determine the differentiability of a function. A function is said to be differentiable if the derivative exists at each point in its domain. To check the differentiability of a function, we first check that the function is continuous at every point in the domain. A function

From playlist Find the Differentiability of a Function

Related pages

Big O notation | Sorting | Quantum algorithm | Expected value | Randomized algorithm | Computational complexity theory | Comparison sort | Decision tree | Decision tree model | Misra–Gries heavy hitters algorithm | Collision problem | Hash table