January 01, 1973 conference-paper Word problems requiring exponential time(Preliminary Report) ACM Symposium on Theory of Computing (STOC) DOI: 10.1145/800125.804029 OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 880 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access The Complexity of Homomorphism Reconstructibility 2025 ACM Transactions on Computation Theory article Computer Science Advanced Graph Theory Research Open access 0 citations The Complexity of Graph Exploration Games 2025 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems 0 citations The Complexity of Online Graph Games 2024 Lecture notes in computer science conference-paper Computer Science Advanced Graph Theory Research 2 citations 3 results References 0