Subjects

Subjects

Sort by: Order: Results:

  • Das, Bireswar; Scharpfenecker, Patrick; Toran, Jacobo (Elsevier, 2017-04)
    It is well-known that succinct encodings of computational problems – using circuits or formulas to encode large instances – generally result in an exponential complexity blow-up compared to their original complexity. We ...
  • Das, Bireswar; Toran, Jacobo; Wagner, Fabian (Elsevier, 2012-08)
    The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time. We give restricted space algorithms for these problems proving the following ...
  • Das, Bireswar (Springer, 2014)
    It is well known that problems encoded with circuits or formulas generally gain an exponential complexity blow-up compared to their original complexity. We introduce a new way for encoding graph problems, based on CNF or ...

Search Digital Repository


Browse

My Account