E-LIB Suche - Ergebnisse für: Mahajan, Meena

1

Linear threshold functions in decision lists, decision tree..:

Dahiya, Yogesh ; K., Vignesh ; Mahajan, Meena.
Information Processing Letters. 183 (2024) - p. 106418 , 2024

2

Hard QBFs for Merge Resolution:

Beyersdorff, Olaf ; Blinkhorn, Joshua ; Mahajan, Meena..
ACM Transactions on Computation Theory. 16 (2024) 2 - p. 1-24 , 2024

Link: https://doi.org/10.1145/..

3

On (simple) decision tree rank:

Dahiya, Yogesh ; Mahajan, Meena
Theoretical Computer Science. 978 (2023) - p. 114177 , 2023

Link: https://doi.org/10.1016/..

4

Hardness Characterisations and Size-width Lower Bounds for ..:

Beyersdorff, Olaf ; Blinkhorn, Joshua ; Mahajan, Meena.
ACM Transactions on Computational Logic. 24 (2023) 2 - p. 1-30 , 2023

Link: https://doi.org/10.1145/..

5

MaxSAT Resolution and Subcube Sums:

Filmus, Yuval ; Mahajan, Meena ; Sood, Gaurav.
ACM Transactions on Computational Logic. 24 (2023) 1 - p. 1-27 , 2023

Link: https://doi.org/10.1145/..

6

Building Strategies into QBF Proofs:

Beyersdorff, Olaf ; Blinkhorn, Joshua ; Mahajan, Meena
Journal of Automated Reasoning. 65 (2020) 1 - p. 125-154 , 2020

Link: https://doi.org/10.1007/..

7

Algebraic branching programs, border complexity, and tangen..:

, In: Proceedings of the 35th Computational Complexity Conference,

Bläser, Markus ; Ikenmeyer, Christian ; Mahajan, Meena.. - p. 1-24 , 2020

Link: https://dl.acm.org/doi/1..

8

Hardness Characterisations and Size-Width Lower Bounds for ..:

, In: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science,

Beyersdorff, Olaf ; Blinkhorn, Joshua ; Mahajan, Meena - p. 209-223 , 2020

Link: https://dl.acm.org/doi/1..

9

MaxSAT Resolution and Subcube Sums:

, In: Theory and Applications of Satisfiability Testing – SAT 2020; Lecture Notes in Computer Science,

Filmus, Yuval ; Mahajan, Meena ; Sood, Gaurav. - p. 295-311 , 2020

Link: https://doi.org/10.1007/..

10

Short Proofs in QBF Expansion:

, In: Lecture Notes in Computer Science; Theory and Applications of Satisfiability Testing – SAT 2019,

Beyersdorff, Olaf ; Chew, Leroy ; Clymo, Judith. - p. 19-35 , 2019

Link: https://doi.org/10.1007/..

11

Depth-2 Threshold Circuits: Provable Limitations:

Mahajan, Meena
Resonance. 24 (2019) 3 - p. 371-380 , 2019

Link: https://doi.org/10.1007/..

12

Research in theoretical computer science:

Mahajan, Meena ; Mukund, Madhavan ; Saxena, Nitin
Communications of the ACM. 62 (2019) 11 - p. 92-95 , 2019

Link: https://dl.acm.org/doi/1..

13

Research in theoretical computer science:

Mahajan, Meena ; Mukund, Madhavan ; Saxena, Nitin
Communications of the ACM. 62 (2019) 11 - p. 92-95 , 2019

Link: https://doi.org/10.1145/..

14

Sums of read-once formulas: How many summands are necessary:

Mahajan, Meena ; Tawari, Anuj
Theoretical Computer Science. 708 (2018) - p. 34-45 , 2018

Link: https://doi.org/10.1016/..

15

Shortest path length with bounded-alternation $$(\min ,+)$$..:

Mahajan, Meena ; Nimbhorkar, Prajakta ; Tawari, Anuj
International Journal of Advances in Engineering Sciences and Applied Mathematics. 11 (2018) 1 - p. 68-74 , 2018

Link: https://doi.org/10.1007/..