Browsing by Subject "Computational complexity"

Now showing items 1-6 of 6

    • Algebraic approach to Nash equilibria for finite normal form games 

      Gandhi, Ratnik (Dhirubhai Ambani Institute of Information and Communication Technology, 2011)
      In this work we consider methods for computing Nash equilibria of finite normal form games that emphasize use of polynomial algebra. Nash equilibria of a game can be characterized as solutions to a system of polynomial ...

    • Comparative Study: Neural Networks on MCUs at the Edge 

      Anand, Harshita (2021)
      Computer vision has evolved excessively over the years, the sizes of the processor and camera shrinking, rising the computational complexity and power and also becoming affordable, making it achievable to be integrated ...

    • Embedding binary trees and caterpillars into the hypercube 

      Srivastava, Abhishek (Dhirubhai Ambani Institute of Information and Communication Technology, 2008)
      Embedding graphs is an important and well-studied theory in parallel computing. Finding the embedding of trees into hypercubes is an important, interesting and difficult problem. This work studies the embedding of binary ...

    • On path complexities of heapsort algorithm and the class stack 

      Mangal, Anupam (Dhirubhai Ambani Institute of Information and Communication Technology, 2007)
      A measure of program complexity, called Path Complexity, based on the number of program execution paths as a function of the input size n, is proposed in [AJ05]. This measure can be used to compare the complexity of two ...

    • Path complexity of maximum segment sum problem 

      Mishra, Devesh (Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
      Various software complexity metrics have been proposed in literature. A program complexity measure called path complexity is proposed in [1]. Path complexity P(A,n) of an algorithm A is defined to be the number of program ...

    • Path complexity of the class binary search tree 

      Doshi, Nishant (Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
      Path complexity of a program is defined as the number of program execution paths as a function of input size n. This notion of program complexity has been extended to complexity of a class as follows. Class had data members ...