Author image not provided
 Nina Taslaman

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article5.00
Citation Count10
Publication count2
Publication years2012-2014
Available for download2
Average downloads per article161.00
Downloads (cumulative)322
Downloads (12 Months)59
Downloads (6 Weeks)8
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


2 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 2 of 2
Sort by:

1 published by ACM
August 2014 ACM Transactions on Algorithms (TALG): Volume 10 Issue 4, August 2014
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 3,   Downloads (12 Months): 19,   Downloads (Overall): 102

Full text available: PDFPDF
We show conditional lower bounds for well-studied #P-hard problems: The number of satisfying assignments of a 2-CNF formula with n variables cannot be computed in time exp( o ( n )), and the same is true for computing the number of all independent sets in an n -vertex graph. The ...
Keywords: Computational complexity, Tutte polynomial, counting problems, exponential time hypothesis, permanent

2
January 2012 SODA '12: Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 5,   Downloads (12 Months): 40,   Downloads (Overall): 220

Full text available: PDFPDF
We give a randomized algorithm that finds a shortest simple cycle through a given set of k vertices or edges in an n -vertex undirected graph in time 2 k n O (1) .



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us