Computational complexity of k-block conjugacy

Article Properties
Cite
Schrock, Tyler, and Rafael Frongillo. “Computational Complexity of K-Block Conjugacy”. Theoretical Computer Science, vol. 856, 2021, pp. 21-40, https://doi.org/10.1016/j.tcs.2020.12.009.
Schrock, T., & Frongillo, R. (2021). Computational complexity of k-block conjugacy. Theoretical Computer Science, 856, 21-40. https://doi.org/10.1016/j.tcs.2020.12.009
Schrock, Tyler, and Rafael Frongillo. “Computational Complexity of K-Block Conjugacy”. Theoretical Computer Science 856 (2021): 21-40. https://doi.org/10.1016/j.tcs.2020.12.009.
Schrock T, Frongillo R. Computational complexity of k-block conjugacy. Theoretical Computer Science. 2021;856:21-40.
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
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
Minimizing finite automata is computationally hard Theoretical Computer Science
  • 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
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 10 2004
The subgraph isomorphism problem for outerplanar graphs Theoretical Computer Science
  • 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
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 23 1982
Optimal state amalgamation is NP-hard

 Ergodic Theory and Dynamical Systems
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
 2 2019
Hardness of conjugacy, embedding and factorization of multidimensional subshifts Journal of Computer and System Sciences
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • 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
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 4 2015
Linear cellular automata and de Bruijn automata 1999
Citations
Title Journal Journal Categories Citations Publication Date
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness 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
 2023
Computational complexity of problems for deterministic presentations of sofic shifts Theoretical Computer Science
  • 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
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2022
Citations Analysis
Category Category Repetition
Science: Mathematics: Instruments and machines: Electronic computers. Computer science2
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software2
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware2
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods1
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 Computational complexity of problems for deterministic presentations of sofic shifts and was published in 2022. The most recent citation comes from a 2023 study titled On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness. This article reached its peak citation in 2023, with 1 citations. It has been cited in 2 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