Hardness Results for the Subpower Membership Problem.
- 주제(키워드) COMPUTATIONAL COMPLEXITY , CUBE TERM , Computational complexity , Cube term , HARDNESS , MALTSEV CONDITION , MEMBERSHIP , Maltsev condition , PROBLEM , RESULTS , SUBPOWER , SUBPOWER MEMBERSHIP PROBLEM , Subpower membership problem
- 발행기관 University of Colorado at Boulder
- 발행년도 2018
- 학위명 박사
- 학과 및 전공 Mathematics
- UCI I804:11009-000000154848
- DOI 10.23186/korea.000000154848.11009.0001028
- 제출원본 PQDT10788707
