Computational problems from graph groups
Post-quantum group-based cryptography · Historical workshop question
Inferred from the community field; finer classification has not been reviewed.
Problem statement
It is known that it is possible to establish correspondence between certain NP-hard graph problems and problems in group theory; we would like to expand our portfolio of such problems.
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
Section context
More general group-theoretic questions with implications in the field.
Progress & source assessment
Historical workshop record. Current open/solved status has not been independently reassessed.
The source supplies no status note for this question.
- [1]Post-quantum group-based cryptography link
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.