Counting Quantifiers, Successor Relations, and Logarithmic Space
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date1997/06/01
-
Indian UGC (journal)
-
Refrences32
-
Citations30
-
Kousha Etessami
Cite
Etessami, Kousha. “Counting Quantifiers, Successor Relations, and Logarithmic Space”. Journal of Computer and System Sciences, vol. 54, no. 3, 1997, pp. 400-11, https://doi.org/10.1006/jcss.1997.1485.
Etessami, K. (1997). Counting Quantifiers, Successor Relations, and Logarithmic Space. Journal of Computer and System Sciences, 54(3), 400-411. https://doi.org/10.1006/jcss.1997.1485
Etessami, Kousha. “Counting Quantifiers, Successor Relations, and Logarithmic Space”. Journal of Computer and System Sciences 54, no. 3 (1997): 400-411. https://doi.org/10.1006/jcss.1997.1485.
Etessami K. Counting Quantifiers, Successor Relations, and Logarithmic Space. Journal of Computer and System Sciences. 1997;54(3):400-11.
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 |
|---|---|---|---|---|
| The Complexity of Iterated Multiplication | Information and Computation |
| 17 | 1995 |
| Two-coloring linked lists is NC1-complete for logarithmic space | Information Processing Letters |
| 2 | 1994 |
| An optimal lower bound on the number of variables for graph identification | Combinatorica |
| 1992 | |
| On uniformity within NC1 | Journal of Computer and System Sciences |
| 1990 | |
| Languages that Capture Complexity Classes | SIAM Journal on Computing |
| 174 | 1987 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Equivalence classes and conditional hardness in massively parallel computations | Distributed Computing |
| 2 | 2022 |
Circuits and Expressions over Finite Semirings | ACM Transactions on Computation Theory |
| 1 | 2018 |
| On the isomorphism problem for decision trees and decision lists | Theoretical Computer Science |
| 3 | 2015 |
Pebble Weighted Automata and Weighted Logics | ACM Transactions on Computational Logic |
| 2 | 2014 |
| Log-Space Algorithms for Paths and Matchings in k-Trees | Theory of Computing Systems |
| 4 | 2013 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 27
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Query Languages for Bags and Aggregate Functions and was published in 1997. The most recent citation comes from a 2022 study titled Equivalence classes and conditional hardness in massively parallel computations. This article reached its peak citation in 2000, with 4 citations. It has been cited in 13 different journals. Among related journals, the Theoretical Computer Science cited this research the most, with 5 citations. The chart below illustrates the annual citation trends for this article.