Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Mahajan, Meena
91  Ergebnisse:
Artikel (Online) X
Personensuche X
?
1

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

Dahiya, Yogesh ; K., Vignesh ; Mahajan, Meena.
Information Processing Letters.  183 (2024)  - p. 106418 , 2024
Link: https://doi.org/10.1016/..
 
?
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

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/..
 
?
4

On (simple) decision tree rank:

Dahiya, Yogesh ; Mahajan, Meena
Theoretical Computer Science.  978 (2023)  - p. 114177 , 2023
Link: https://doi.org/10.1016/..
 
?
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

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/..
 
?
8

Depth-2 Threshold Circuits: Provable Limitations:

Mahajan, Meena
Resonance.  24 (2019)  3 - p. 371-380 , 2019
Link: https://doi.org/10.1007/..
 
?
9

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..
 
?
10

Understanding cutting planes for QBFs:

Beyersdorff, Olaf ; Chew, Leroy ; Mahajan, Meena.
Information and Computation.  262 (2018)  - p. 141-161 , 2018
Link: https://doi.org/10.1016/..
 
?
11

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/..
 
?
12

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/..
 
?
13

Are Short Proofs Narrow? QBF Resolution IsNotSo Simple:

Beyersdorff, Olaf ; Chew, Leroy ; Mahajan, Meena.
ACM Transactions on Computational Logic.  19 (2017)  1 - p. 1-26 , 2017
Link: https://doi.org/10.1145/..
 
?
14

Are Short Proofs Narrow? QBF Resolution Is Not So Simple:

Beyersdorff, Olaf ; Chew, Leroy ; Mahajan, Meena.
ACM Transactions on Computational Logic (TOCL).  19 (2017)  1 - p. 1-26 , 2017
Link: https://dl.acm.org/doi/1..
 
?
15

Some Complete and Intermediate Polynomials in Algebraic Com..:

Mahajan, Meena ; Saurabh, Nitin
Theory of Computing Systems.  62 (2017)  3 - p. 622-652 , 2017
Link: https://doi.org/10.1007/..
 
1-15