Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration | Paper Citation Record

Observation e176b7d8-60d0-4741-b50e-c9aca5a0a371 · outbound

This paper cites Exponential Bounds for.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Exponential Bounds for

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.249691Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 80faf9c7-8e3a-4786-9408-e5ee01b4fa35 · outbound

This paper cites Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) , Year =

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.254484Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ef3c4dcb-0cf9-4d63-a481-d658e8bcc287 · outbound

This paper cites Random Structures & Algorithms , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Random Structures & Algorithms , Year =

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.258277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b921135-691e-4b42-bde0-c4f529bba7ec · outbound

This paper cites On Approximation Algorithms for Hierarchical.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration On Approximation Algorithms for Hierarchical

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.262279Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00909a90-dfb8-4d8a-8c56-3626299e4f5f · outbound

This paper cites Algorithmica , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Algorithmica , Year =

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.266654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9ab7f423-f191-4dd6-abe2-e37e17849f40 · outbound

This paper cites Proceedings of the European Symposium on Algorithms (ESA) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the European Symposium on Algorithms (ESA) , Year =

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.270471Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e2a7cc9-fd4a-4700-b9f3-f24a5a8cf488 · outbound

This paper cites Deterministic Simulation in.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Deterministic Simulation in

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.273919Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ffc02ddb-1cb4-4144-a236-64f5e8397285 · outbound

This paper cites Combinatorica , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Combinatorica , Year =

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.277989Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 36b6f671-679b-40ba-9e78-1d637ae12072 · outbound

This paper cites Discrete Mathematics , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Discrete Mathematics , Year =

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.281696Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 57e6d9c6-7d6d-4457-8712-5477c32df69b · outbound

This paper cites Computational Complexity , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Computational Complexity , Year =

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.284938Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 96d40b71-521a-4545-9d96-bbd58dddfd40 · outbound

This paper cites 2016 , Series =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration 2016 , Series =

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.288870Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c0cc9d62-f20a-4590-81d9-91548202f67c · outbound

This paper cites Proceedings of the Conference on Computational Complexity (CCC) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the Conference on Computational Complexity (CCC) , Year =

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.292154Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d8b01c50-551a-45db-aee8-a75484bc8496 · outbound

This paper cites Journal of Computer and System Sciences , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Journal of Computer and System Sciences , Year =

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.296166Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41f64c9c-8c3a-4b7d-bc76-af6aa328239d · outbound

This paper cites 2009 , Doi =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration 2009 , Doi =

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.300387Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f816eb76-13bb-4546-8256-8d441325e677 · outbound

This paper cites Journal of the ACM , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Journal of the ACM , Year =

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.303884Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6941afb9-afa7-45e4-8546-27644f210756 · outbound

This paper cites Probabilistic Checking of Proofs: A New Characterization of.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Probabilistic Checking of Proofs: A New Characterization of

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.307342Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 811abcf9-2281-49bf-80f6-73e2f4403286 · outbound

This paper cites Combinatorica , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Combinatorica , Year =

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.310888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3cc9c47d-acdf-4e00-9788-d11c9236527a · outbound

This paper cites Balanced.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Balanced

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.314467Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c5b05a91-88b1-4a4a-9151-33146d9b9c0d · outbound

This paper cites Theory of Computing , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Theory of Computing , Year =

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.318569Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b29fc888-efae-45d5-9910-366d27f1be92 · outbound

This paper cites an unresolved cited work.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Unresolved cited work

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.322042Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4d1964fd-f6c5-48ea-894f-572a7523cfeb · outbound

This paper cites Computational Complexity , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Computational Complexity , Year =

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.325681Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 37618838-8fa6-4c46-b416-9174302d5bb5 · outbound

This paper cites Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) , Year =

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.328714Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 788a87d0-d422-41ab-8ef9-e475616b9ea6 · outbound

This paper cites Proceedings of the ACM Symposium on Theory of Computing (STOC) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the ACM Symposium on Theory of Computing (STOC) , Year =

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.331824Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3abc2896-ae2d-4940-8ba8-fc5674feaac8 · outbound

This paper cites Quasi-Linear Size.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Quasi-Linear Size

Reference 24

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.335523Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation db4164b1-8999-496f-8859-a008f62dcf02 · outbound

This paper cites Journal of Computer and System Sciences , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Journal of Computer and System Sciences , Year =

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.338607Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eb5f8a65-b555-447d-b0b7-9081981d01a2 · outbound

This paper cites IEEE Transactions on Information Theory , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration IEEE Transactions on Information Theory , Year =

Reference 26

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.342906Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 675a49b2-038d-4cd9-922f-0b3f0d28d25f · outbound

This paper cites Free Bits,.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Free Bits,

Reference 27

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.346280Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 24b4d41e-033a-4524-8ac0-52b1740dc25c · outbound

This paper cites Proceedings of the ACM Symposium on Theory of Computing (STOC) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the ACM Symposium on Theory of Computing (STOC) , Year =

Reference 28

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.350318Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 12008f91-1c9a-40e4-9467-f005520f92ee · outbound

This paper cites Theory of Computing Systems , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Theory of Computing Systems , Year =

Reference 29

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.353749Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fd728b11-9471-4e54-97c1-be7acbf5d516 · outbound

This paper cites an unresolved cited work.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Unresolved cited work

Reference 30

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.357168Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation def538d9-f362-4744-ae8c-b671f9e9e8b7 · outbound

This paper cites Randomness-efficient low degree tests and short.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Randomness-efficient low degree tests and short

Reference 31

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.361127Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8288236d-ffe3-4b1d-a493-9248d3fb5a2d · outbound

This paper cites SIAM Journal on Computing , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration SIAM Journal on Computing , Year =

Reference 32

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.365290Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 252e7b99-4790-4993-bae4-50991d066587 · outbound

This paper cites Stochastic Processes and their Applications , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Stochastic Processes and their Applications , Year =

Reference 33

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.368640Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a619b45-c1b8-4b7b-bd53-a5c2758d5227 · outbound

This paper cites Discrete Applied Mathematics , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Discrete Applied Mathematics , Year =

Reference 34

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.371965Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 040637ea-6d79-496f-89b9-70e704c9a70c · outbound

This paper cites Rigid Matrices From Rectangular.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Rigid Matrices From Rectangular

Reference 35

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.376119Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 261e9fb6-f8f0-4c70-af21-da30fe97b297 · outbound

This paper cites 2022 , Number =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration 2022 , Number =

Reference 36

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.380294Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 40248f81-8c20-4052-853e-66527f2ec2b7 · outbound

This paper cites Proceedings of the International Workshop on Combinatorial Algorithms (IWOCA) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the International Workshop on Combinatorial Algorithms (IWOCA) , Year =

Reference 37

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.383908Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9911bc60-a45e-4686-bb00-6cae85477fa5 · outbound

This paper cites Journal of Computer and System Sciences , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Journal of Computer and System Sciences , Year =

Reference 38

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.387800Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d4d04d13-6289-4f6e-bd56-b496f2a02807 · outbound

This paper cites and Groenland, Carla and Nederlof, Jesper and Swennenhuis, C\'.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration and Groenland, Carla and Nederlof, Jesper and Swennenhuis, C\'

Reference 39

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.390762Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0edfe36b-70db-4286-91e0-636e6199bf96 · outbound

This paper cites Algorithmica , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Algorithmica , Year =

Reference 40

Resolution: verified exact; doi, observed 2026-07-31T17:55:58.367886Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 123a9e4d-5190-4044-9113-904594e7f1ba · outbound

This paper cites Electronic Colloquium on Computational Complexity , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Electronic Colloquium on Computational Complexity , Year =

Reference 41

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.397223Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 31d24878-1a0e-4b9e-a74c-088f77366fb4 · outbound

This paper cites Reconfiguring Independent Sets in Cographs.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Reconfiguring Independent Sets in Cographs

Reference 42

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.400459Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8933f8a2-f187-4a73-9046-7291a8a724b9 · outbound

This paper cites Electronic Notes in Discrete Mathematics , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Electronic Notes in Discrete Mathematics , Year =

Reference 43

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.404794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 33cb7359-9095-41e9-926b-ef2baf1bba23 · outbound

This paper cites Shortest Reconfiguration of Colorings Under.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Shortest Reconfiguration of Colorings Under

Reference 44

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.408557Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2d62cafd-2244-4de6-9367-8cf1d93f9689 · outbound

This paper cites Journal of Combinatorial Optimization , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Journal of Combinatorial Optimization , Year =

Reference 45

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.411831Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ac43a5b3-e450-40c1-9a5e-fd4fee91b634 · outbound

This paper cites Electronic Notes in Discrete Mathematics , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Electronic Notes in Discrete Mathematics , Year =

Reference 46

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.414947Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c79a613-8e7a-476d-b4ea-b4687556da7e · outbound

This paper cites Algorithmica , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Algorithmica , Year =

Reference 47

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.418734Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 385d7f3f-a731-4e3e-a1cf-cddbcc8b578a · outbound

This paper cites Journal of Graph Theory , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Journal of Graph Theory , Year =

Reference 48

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.422468Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b3933319-c96d-483b-ab51-0c46e32fbfb4 · outbound

This paper cites Theoretical Computer Science , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Theoretical Computer Science , Year =

Reference 49

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.425645Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 36fc4b3f-f4ee-4823-8698-c36936f3a742 · outbound

This paper cites Finding paths between graph colourings:.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Finding paths between graph colourings:

Reference 50

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.429169Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0497a72d-589a-4b60-bc9d-00f66c0f6d0b · outbound

This paper cites Proceedings of the Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) , Year =

Reference 51

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.432325Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2faa3315-9f6d-4696-84b9-cf0d535d5156 · outbound

This paper cites and Nishimura, Naomi and Raman, Venkatesh , Booktitle =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration and Nishimura, Naomi and Raman, Venkatesh , Booktitle =

Reference 52

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.435926Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 01d91434-f716-4544-8b0e-7149820a5ba9 · outbound

This paper cites A Note on the Complexity of Graph Recoloring.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration A Note on the Complexity of Graph Recoloring

Reference 53

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.439061Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cf9f5863-dc1f-4ce7-ba80-a6a4fb913235 · outbound

This paper cites Proceedings of the European Symposium on Algorithms (ESA) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the European Symposium on Algorithms (ESA) , Year =

Reference 54

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.442845Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b7e252e6-46a0-49fb-a4e9-e241fc2c31ec · outbound

This paper cites The Electronic Journal of Combinatorics , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration The Electronic Journal of Combinatorics , Year =

Reference 55

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.446151Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4928830-8818-4bb1-9131-038cbf07dd51 · outbound

This paper cites Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG) , Year =

Reference 56

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.450378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9ed4545e-5b14-405b-a415-de85a6bf8b42 · outbound

This paper cites Algorithmica , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Algorithmica , Year =

Reference 57

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.453740Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 60acf484-a0df-43db-afef-164521b2c688 · outbound

This paper cites Proceedings of the European Symposium on Algorithms (ESA) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the European Symposium on Algorithms (ESA) , Year =

Reference 58

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.457759Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c7adaf0f-0943-42e9-8b52-1ae0175f23a6 · outbound

This paper cites Proceedings of the International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) , Year =

Reference 59

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.461432Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e06ecad0-c711-45d4-abd7-f14d643ce9f5 · outbound

This paper cites Proceedings of the International Workshop on Approximation and Online Algorithms (WAOA) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the International Workshop on Approximation and Online Algorithms (WAOA) , Year =

Reference 60

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.464842Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0608aeb4-fe52-404b-bd5c-c5f42e37e888 · outbound

This paper cites Computer Science Review , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Computer Science Review , Year =

Reference 61

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.468326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0bf05c94-d9b7-43e0-858f-2e6b4811d12e · outbound

This paper cites Tight approximability of.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Tight approximability of

Reference 62

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.471433Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cae1682e-9bee-490e-8a81-f47f962a2905 · outbound

This paper cites Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) , Year =

Reference 63

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.475508Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0900c6aa-115d-4ba8-a974-9789ada7cb21 · outbound

This paper cites Proceedings of the International Symposium on Mathematical Foundations of Computer Science (MFCS) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the International Symposium on Mathematical Foundations of Computer Science (MFCS) , Year =

Reference 64

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.479294Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation afb258b2-4071-45fc-9c07-bece27509093 · outbound

This paper cites Theoretical Computer Science , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Theoretical Computer Science , Year =

Reference 65

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.482338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 45f21bae-05b1-4e68-a105-48bf53ffcf99 · outbound

This paper cites Proceedings of the Innovations in Theoretical Computer Science Conference (ITCS) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the Innovations in Theoretical Computer Science Conference (ITCS) , Year =

Reference 66

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.485589Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 920cfad5-bda1-45c0-8b67-2d5d0c2b92f5 · outbound

This paper cites 2007 , Url =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration 2007 , Url =

Reference 67

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.489537Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 328ede52-0f12-45c0-9f2b-729522fc6893 · outbound

This paper cites Journal of Graph Theory , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Journal of Graph Theory , Year =

Reference 68

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.493509Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f474a523-adf8-4213-ae2c-cc1433744415 · outbound

This paper cites European Journal of Combinatorics , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration European Journal of Combinatorics , Year =

Reference 69

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.497341Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc66591d-1e4f-4d63-b32c-baa8659a72b3 · outbound

This paper cites Discrete Mathematics , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Discrete Mathematics , Year =

Reference 70

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.501835Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d67ac458-d85c-4750-9de0-1d913984038f · outbound

This paper cites Hardness of Approximation in.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Hardness of Approximation in

Reference 71

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.504903Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d96537b2-51df-4036-92d0-03265fdf378c · outbound

This paper cites Journal of the ACM , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Journal of the ACM , Year =

Reference 72

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.508302Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a7035bbe-fff3-4051-84b4-44881648b0d7 · outbound

This paper cites Algorithmica , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Algorithmica , Year =

Reference 73

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.511717Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 09253aa8-3e7a-4aa7-8ed6-b5d79301c60d · outbound

This paper cites SIAM Journal on Discrete Mathematics , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration SIAM Journal on Discrete Mathematics , Year =

Reference 74

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.514925Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5eaee8a1-46e1-460a-b1cd-545f32a8052a · outbound

This paper cites From Algorithms to Connectivity and Back: Finding a Giant Component in Random.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration From Algorithms to Connectivity and Back: Finding a Giant Component in Random

Reference 75

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.518319Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ae91389d-1cc3-4f9a-92c7-2faad6b498d1 · outbound

This paper cites The Annals of Mathematical Statistics , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration The Annals of Mathematical Statistics , Year =

Reference 76

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.521487Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c0e4e5b1-5538-4e9b-8f4d-9683b379e934 · outbound

This paper cites On Parallel Repetition of.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration On Parallel Repetition of

Reference 77

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.524524Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation df521cc0-033e-4e1f-931d-e30d5d8a40a8 · outbound

This paper cites Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) , Year =

Reference 78

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.527680Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4af7bef9-ebe4-42d1-bed8-2c494e16b6e6 · outbound

This paper cites Mathematics of Operations Research , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Mathematics of Operations Research , Year =

Reference 79

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.531034Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce322e96-a383-417d-94de-32830ea02147 · outbound

This paper cites , Booktitle =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration , Booktitle =

Reference 80

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.534494Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bcae0094-d453-4962-808a-4007c0f7a170 · outbound

This paper cites Advances in Mathematics , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Advances in Mathematics , Year =

Reference 81

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.537964Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d9391470-6b88-4b2d-9ecf-bfe3123b5343 · outbound

This paper cites Approximate Solutions to Problems in.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Approximate Solutions to Problems in

Reference 82

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.541187Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 013ae2ff-20b0-479c-b0a6-ba5a810c1c14 · outbound

This paper cites SIAM Journal on Computing , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration SIAM Journal on Computing , Year =

Reference 83

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.544664Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c407c31-8040-441b-b51e-6d82248d2ceb · outbound

This paper cites , Journal =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration , Journal =

Reference 84

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.547892Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ba0034e5-c8ff-41f6-a003-2a30f093a9bb · outbound

This paper cites Proceedings of the IEEE Conference on Computational Complexity (CCC) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the IEEE Conference on Computational Complexity (CCC) , Year =

Reference 85

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.551960Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 66a88f6f-891e-42de-a34b-8c3ca921e8bc · outbound

This paper cites Theory of Computing Systems , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Theory of Computing Systems , Year =

Reference 86

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.555995Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1bb7969c-0003-463d-baa1-a52f97872b94 · outbound

This paper cites 2015 , Doi =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration 2015 , Doi =

Reference 87

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.559898Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 508d182d-e7d6-40d2-a0be-b50c4022e097 · outbound

This paper cites SIAM Journal on Computing , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration SIAM Journal on Computing , Year =

Reference 88

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.563746Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94e0db3e-f2ab-4dc7-ade6-e957758e3f4b · outbound

This paper cites Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) , Year =

Reference 89

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.567409Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 59499720-2a22-4e91-a2df-3f6b36dbf02a · outbound

This paper cites Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) , Year =

Reference 90

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.570748Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4c56dbe1-4f34-45a2-8ef1-46d3a919b5ef · outbound

This paper cites an unresolved cited work.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Unresolved cited work

Reference 91

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.574204Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 06dce67f-a2d4-4d49-b9fd-8ecef8d60a35 · outbound

This paper cites Theoretical Computer Science , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Theoretical Computer Science , Year =

Reference 92

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.577501Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 165e9abc-1525-44b5-9d0e-b6f9541c0a1e · outbound

This paper cites Proceedings of the International Symposium on Algorithms and Data Structures (WADS) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the International Symposium on Algorithms and Data Structures (WADS) , Year =

Reference 93

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.580595Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2da74e5c-5c4e-47b4-98fb-0e356208765b · outbound

This paper cites Proceedings of the ACM Symposium on Theory of Computing (STOC) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the ACM Symposium on Theory of Computing (STOC) , Year =

Reference 94

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.584207Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 151c78ae-0f21-4910-8e97-2169ea9a01ba · outbound

This paper cites Proceedings of the ACM Symposium on Theory of Computing (STOC) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the ACM Symposium on Theory of Computing (STOC) , Year =

Reference 95

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.588500Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 69c997bc-655b-4226-be54-29870ec0a9da · outbound

This paper cites Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) , Year =

Reference 96

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.592536Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20b8d4b0-f660-437c-8b74-4f62423974d8 · outbound

This paper cites Low Acceptance Agreement Tests via Bounded-Degree Symplectic.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Low Acceptance Agreement Tests via Bounded-Degree Symplectic

Reference 97

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.595778Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5e5cdc43-1c03-427c-b2fa-773b552b1012 · outbound

This paper cites Annals of Mathematics , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Annals of Mathematics , Year =

Reference 98

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.599110Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 034ab954-d6c5-46ed-a850-f3c4ce42af07 · outbound

This paper cites an unresolved cited work.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Unresolved cited work

Reference 99

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.602804Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2dd62fac-dd4b-43a1-b975-8bda338bdb5b · outbound

This paper cites Proceedings of the Annual IEEE Symposium on Foundations of Computer Science , Year =.

Optimal PSPACE-hardness of Approximating $q$-CSP Reconfiguration Proceedings of the Annual IEEE Symposium on Foundations of Computer Science , Year =

Reference 100

Resolution: unresolved; no resolver link, observed 2026-07-31T17:52:58.606417Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers