The Advaith

According to Megiddo's 1984 paper, LP is in linear time if the number of constraints is fixed. So, given a (n+d)*m matrix, it is not cle...

The main idea of CM-Z is finding maximal independent subspaces (1) without using a LP formulation and (2) in a fast way. The scheduling ma...

How many times when we feel happy do we feel a sadness for the time when all this will go away and yearn for an unending stream of happiness...

I removed the following section from the links. -- My interests: Philosophy, Vedanta, Advaita, Theoretical Computer Science, Computational C...

One main feature of CM-Z algorithm is the computation of either a witness vector or a separating vector (are they the same? look for the not...

Originally, al had asked me to suggest some books on advaita. I thought that his main interests were Christianity and so suggested Shri Prab...

Reading Cohen-Megiddo's (CM-Z) paper. Some notes. The paper does not seem to do a KMW-like decomposition. This is why in the DV-KMW pap...

Problems to solve on unitary graphs (directed graphs whose edges are annotated by d-dimensional weights each component of which is from the ...

These are some books Golumbic's book or Shamir's notes Schrijver's any of three books: Schrijver1984, Cook... Schrijver, Schrij...

If total-unimodularity of incidence matrices of digraphs implies max-flow min-cut theorem, why should it not imply integral schedules? Premi...

There is a paper by Goldberg and Rao in Beyond the Flow decomposition barrier . It seems a natural lower bound of O(nm) on the flowproblem d...

Suppose we assume that Bx 0 This can be written as two inequalities Bx >= 1 Bx We can search for a vector x that satisfies these constr...

The matrices which are used to convert from a "real" to gray and back again are total-unimodular. What does this mean in a linear ...

It seems that Buddhism had the following doctrines which were not that prevalent in Hinduism earlier: significance of ahimsa construction ...

Things, like searching for a cycle etc., can be done in polynomial time when a graph is TUM. What does this mean for a SAT problem? In gener...

Given a (rectangular???)loop nest, with uniform dependences, further, with all dependences in first orthant (with enough skewing), find a ti...

The link on Advaita philosophy seems to be good. Has a good explanation of Dakshinamurthy Astakam and its explanation of Advaita. Donot mis...

Problem: Given a matrix B of size (n+d)*m, with each element of B from the set {+1,-1,0}, find a column vector x of size m, with each eleme...

These are some questions related on KMW and TUM. The uniformization problem of Darte-Vivien: Take a PRDG with possibly non-uniform dependen...

Reading Schrijver book for TUM. Some notes Bipartite graphs are TUM. Directed graphs are TUM. Max-flow min-cut theorem is a restatement of T...