Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
- Submitting institution
-
Birkbeck College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 192
- Type
- D - Journal article
- DOI
-
10.1016/j.jcss.2018.01.004
- Title of journal
- Journal of Computer and System Sciences
- Article number
- -
- First page
- 69
- Volume
- 95
- Issue
- -
- ISSN
- 0022-0000
- Open access status
- Technical exception
- Month of publication
- April
- Year of publication
- 2018
- URL
-
http://eprints.bbk.ac.uk/id/eprint/24757/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
1 - Algorithms, Verification and Software
- Citation count
- 3
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- In this paper we combined several techniques to design deterministic, polynomial-space counting algorithms with faster running times than previously known. Our techniques, among them a polynomial-space variant of a fundamental derandomization technique, have already been used to improve other results in the area of substructure counting.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
