Simplifying the weft hierarchy
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2006/02/01
-
Journal
-
Indian UGC (journal)
-
Refrences6
-
Citations3
-
Jonathan F. Buss
-
Tarique Islam
Cite
Buss, Jonathan F., and Tarique Islam. “Simplifying the Weft Hierarchy”. Theoretical Computer Science, vol. 351, no. 3, 2006, pp. 303-1, https://doi.org/10.1016/j.tcs.2005.10.002.
Buss, J. F., & Islam, T. (2006). Simplifying the weft hierarchy. Theoretical Computer Science, 351(3), 303-313. https://doi.org/10.1016/j.tcs.2005.10.002
Buss, Jonathan F., and Tarique Islam. “Simplifying the Weft Hierarchy”. Theoretical Computer Science 351, no. 3 (2006): 303-13. https://doi.org/10.1016/j.tcs.2005.10.002.
Buss JF, Islam T. Simplifying the weft hierarchy. Theoretical Computer Science. 2006;351(3):303-1.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Fixed-parameter tractability, definability, and model-checking | SIAM Journal on Computing |
| 2001 | |
| On the amount of nondeterminism and the power of verifying | SIAM Journal on Computing |
| 1997 | |
| On the parameterized complexity of short computation and factorization | Archive for Mathematical Logic |
| 24 | 1997 |
| Bounded nondeterminism and alternation in parameterized complexity theory | 2003 | |||
| 10.1007/978-3-540-45220-1_12 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications | SIAM Journal on Computing |
| 21 | 2010 |
The complexity of fixed-parameter problems | ACM SIGACT News | 1 | 2008 | |
| Algorithms in the W-Hierarchy | Theory of Computing Systems |
| 2007 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 2
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Algorithms in the W-Hierarchy and was published in 2007. The most recent citation comes from a 2010 study titled On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications. This article reached its peak citation in 2010, with 1 citations. It has been cited in 3 different journals. Among related journals, the SIAM Journal on Computing cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.