Author of the publication

Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth.

, , , , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 336-347. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Komarath, Balagopal
add a person with the name Komarath, Balagopal
 

Other publications of authors with the same name

Rabbits Approximate, Cows Compute Exactly!, , and . MFCS, volume 241 of LIPIcs, page 65:1-65:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Pebbling, Entropy and Branching Program Size Lower Bounds., and . STACS, volume 20 of LIPIcs, page 622-633. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)On the complexity of detecting hazards., and . Inf. Process. Lett., (2020)Pebbling Meets Coloring: Reversible Pebble Game On Trees., , and . CoRR, (2016)On the Complexity of L-reachability., , and . CoRR, (2017)Graph Homomorphism Polynomials: Algorithms and Complexity., , and . CoRR, (2020)Comparator Circuits over Finite Bounded Posets., , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 834-845. Springer, (2015)Reversible Pebble Game on Trees., , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 83-94. Springer, (2015)Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth., , , , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 336-347. Springer, (2014)On the Complexity of L-reachability., , and . DCFS, volume 8614 of Lecture Notes in Computer Science, page 258-269. Springer, (2014)