Strong Self-Reducibility Precludes Strong Immunity

Article Properties
Citations
Title Journal Journal Categories Citations Publication Date
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets SIAM Journal on Computing
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
1997
Citations Analysis
The category Science: Mathematics: Instruments and machines: Electronic computers. Computer science 1 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets and was published in 1997. The most recent citation comes from a 1997 study titled Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets. This article reached its peak citation in 1997, with 1 citations. It has been cited in 1 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.
Citations used this article by year