Year |
Citation |
Score |
2018 |
Sedghi H, Sabharwal A. Knowledge Completion for Generics Using Guided Tensor Factorization Transactions of the Association For Computational Linguistics. 6: 197-210. DOI: 10.1162/Tacl_A_00015 |
0.35 |
|
2015 |
Koncel-Kedziorski R, Hajishirzi H, Sabharwal A, Etzioni O, Ang SD. Parsing Algebraic Word Problems into Equations Transactions of the Association For Computational Linguistics. 3: 585-597. DOI: 10.1162/Tacl_A_00160 |
0.346 |
|
2014 |
Dilkina B, Gomes CP, Sabharwal A. Tradeoffs in the complexity of backdoors to satisfiability: Dynamic sub-solvers and learning during search Annals of Mathematics and Artificial Intelligence. 70: 399-431. DOI: 10.1007/S10472-014-9407-9 |
0.453 |
|
2012 |
Conrad JM, Gomes CP, van Hoeve WJ, Sabharwal A, Suter JF. Wildlife corridors as a connected subgraph problem Journal of Environmental Economics and Management. 63: 1-18. DOI: 10.1016/J.Jeem.2011.08.001 |
0.393 |
|
2010 |
Cary M, Rudra A, Sabharwal A, Vee E. Floodlight illumination of infinite wedges Computational Geometry: Theory and Applications. 43: 23-34. DOI: 10.1016/J.Comgeo.2007.01.004 |
0.627 |
|
2009 |
Gomes CP, Sabharwal A, Selman B. Model counting Frontiers in Artificial Intelligence and Applications. 185: 633-654. DOI: 10.3233/978-1-58603-929-5-633 |
0.317 |
|
2009 |
van Hoeve W, Pesant G, Rousseau L, Sabharwal A. New filtering algorithms for combinations of among constraints Constraints. 14: 273-292. DOI: 10.1007/S10601-008-9067-7 |
0.323 |
|
2009 |
Sabharwal A. SymChaff: Exploiting symmetry in a structure-aware satisfiability solver Constraints. 14: 478-505. DOI: 10.1007/S10601-008-9060-1 |
0.413 |
|
2008 |
Kroc L, Sabharwal A, Selman B. Leveraging belief propagation, backtrack search, and statistics for model counting Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5015: 127-141. DOI: 10.1007/S10479-009-0680-7 |
0.378 |
|
2007 |
Beame P, Impagliazzo R, Sabharwal A. The resolution complexity of independent sets and vertex covers in random graphs Computational Complexity. 16: 245-297. DOI: 10.1007/S00037-007-0230-0 |
0.653 |
|
2004 |
Beame P, Kautz H, Sabharwal A. Towards understanding and harnessing the potential of clause learning Journal of Artificial Intelligence Research. 22: 319-351. DOI: 10.1613/Jair.1410 |
0.619 |
|
2004 |
Sabharwal A, Beame P, Kautz H. Using problem structure for efficient clause learning Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2919: 242-256. |
0.35 |
|
2002 |
Buresh-Oppenheim J, Beame P, Pitassi T, Raz R, Sabharwal A. Bounded-depth Frege lower bounds for weaker pigeonhole principles Annual Symposium On Foundations of Computer Science - Proceedings. 583-592. DOI: 10.1137/S0097539703433146 |
0.626 |
|
2001 |
Beame P, Impagliazzo R, Sabharwal A. Resolution complexity of independent sets in random graphs Proceedings of the Annual Ieee Conference On Computational Complexity. 52-68. |
0.422 |
|
Show low-probability matches. |