factoring complexity class - SERP Analysis

https://en.wikipedia.org/wiki/Integer_factorization

https://blog.computationalcomplexity.org/2002/09/complexity-class-of-week-factoring.html

https://www.cs.purdue.edu/homes/ssw/2014c.pdf

https://mathoverflow.net/questions/200599/what-is-the-complexity-class-of-the-function-variant-of-the-integer-factorizat

https://math.stackexchange.com/questions/1624390/why-isnt-integer-factorization-in-complexity-p-when-you-can-factorize-n-in-o%E2%88%9A

https://cohn.mit.edu/factoring/

https://cstheory.stackexchange.com/questions/25466/factoring-as-a-decision-problem

https://en.wikipedia.org/wiki/Shor%27s_algorithm

https://blog.computationalcomplexity.org/2010/08/factoring-in-p.html

https://www.youtube.com/watch?v=qNurf7UNMjk

https://cacm.acm.org/news/the-world-of-tfnp/

https://www.reddit.com/r/compsci/comments/40zpax/eli5_if_factorization_of_prime_numbers_is_in_np/

https://rjlipton.com/2012/09/26/how-not-to-prove-integer-factoring-is-in-p/

https://www.csa.iisc.ac.in/~chandan/courses/complexity22/lectures/lec6.pdf

https://itch.io/jam/nondeterministic-november/topic/2421107/factoring-integers-np-complete-or-not

http://connellybarnes.com/documents/factoring.pdf

https://www.naut.ca/blog/2019/03/29/prime-factorization-in-p/

https://stackoverflow.com/questions/12637582/why-is-integer-factorization-a-non-polynomial-time

https://rjlipton.com/2011/01/23/is-factoring-really-in-bqp-really/

https://www.researchgate.net/publication/228720138_On_the_TFNP_complexity_of_factoring

https://mathworld.wolfram.com/PrimeFactorization.html

https://stackoverflow.com/questions/6005873/determining-complexity-of-an-integer-factorization-algorithm

https://complexityzoo.net/Complexity_Garden

https://www.quora.com/What-happens-if-someone-discovers-polynomial-time-algorithm-for-integer-factorization-problems

https://www.cse.iitk.ac.in/users/nitin/papers/factor-closure.pdf

https://www.quora.com/Why-is-finding-a-polynomial-time-reduction-to-prime-factoring-a-seemingly-more-complicated-or-at-least-different-procedure-than-other-problems-in-NP-Is-it-perhaps-in-a-different-class-or-sub-class-of-NP-problems

https://theoryofcomputing.org/articles/v015a013/

https://oeis.org/wiki/Prime_factorization

https://arxiv.org/pdf/2205.10074

https://www.reddit.com/r/philosophy/comments/629yz0/a_video_talking_about_how_concepts_from/

https://www.sciencedirect.com/topics/mathematics/factorization-problem

https://www.youtube.com/watch?v=tq8dTl74bL0

https://www.cambridge.org/core/journals/mathematical-structures-in-computer-science/article/synchronizing-words-and-monoid-factorization-yielding-a-new-parameterized-complexity-class/2910A2134026357AC684F256DB5C0349

https://www.cse.iitk.ac.in/users/nitin/papers/PresentableVNP.pdf

https://github.com/dwave-examples/factoring-notebook

https://epubs.siam.org/doi/10.1137/0215083

https://taylorandfrancis.com/knowledge/Engineering_and_technology/Computer_science/Complexity_classes/

https://www.prateekdwivedi.in/slides/2024-itu.pdf

https://static.hlt.bme.hu/semantics/external/pages/egyir%C3%A1ny%C3%BA_f%C3%BCggv%C3%A9nyek/en.wikipedia.org/wiki/Integer_factorization.html

https://users.math.cas.cz/~jerabek/talks/factoring.pdf

https://digitalcommons.lib.uconn.edu/cgi/viewcontent.cgi?article=1380&context=srhonors_theses

https://www.researchgate.net/publication/2324043_On_The_Oracle_Complexity_Of_Factoring_Integers

https://www.dcs.warwick.ac.uk/~u2270030/act2023icalp/slides/ICALP2023ACT_dutta.pdf

https://dl.acm.org/doi/10.1145/3510359

https://homes.cerias.purdue.edu/~ssw/squfof2.pdf

https://www.ictp-saifr.org/wp-content/uploads/2018/10/L7-Complexity-Theory-II.pdf

https://link.springer.com/article/10.1007/s10559-022-00463-0

https://algo.inria.fr/seminars/sem00-01/morain.html

https://mat112.uncg.edu/pauli/publications/pauli_factoring-polynomial-over-local-fields.pdf

https://eprint.iacr.org/2002/109.pdf

https://www.cs.cmu.edu/~glmiller/Publications/Papers/BMS86.pdf

https://drops.dagstuhl.de/storage/00lipics/lipics-vol317-approx-random2024/LIPIcs.APPROX-RANDOM.2024.75/LIPIcs.APPROX-RANDOM.2024.75.pdf

https://courses.cs.duke.edu/spring06/cps237/Quantum.papers/shor.factoring.pdf

https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=2273d9829cdf7fc9d3be3cbecb961c7a6e4a34ea

https://alexgelin.fr/doc/11396.pdf

https://arxiv.org/abs/1710.03214

https://people.csail.mit.edu/rrw/6.045-2020/lec18-color.pdf

https://williamhoza.com/teaching/spring2024-intro-to-complexity/c25-bqp-conp-logspace.pdf

https://cs.uwaterloo.ca/~shallit/Papers/spf.pdf

https://gilkalai.wordpress.com/2013/01/28/primality-and-factoring-in-number-fields/

https://web.lums.edu.pk/~imdad/pdfs/CS510_Slides/CS510-Slides-20-03-Complexity-Class-coNP-EXP.pdf

https://www.dr-qubit.org/teaching/AQIT/AQIT01_complexity_overview.pdf

https://www.math.fsu.edu/~hoeij/papers/issac10/A.pdf

https://library.fiveable.me/quantum-computing/unit-7/shors-algorithm-implementation-complexity-analysis/study-guide/Dyt2CJCRHfQoSapP

https://courses.cs.cornell.edu/cs4814/2020sp/lectures/goodcharacterization.pdf

https://complexityzoo.net/Complexity_Zoo:Q

https://cc.ee.ntu.edu.tw/~rbwu/rapid_content/course/QC/Shor1994.pdf

https://academickids.com/encyclopedia/index.php/Integer_factorization

https://fse.studenttheses.ub.rug.nl/31985/1/bMATH_2024_ColellaD.pdf

https://www.scottaaronson.com/democritus/lec6.html

https://ebrary.net/134430/computer_science/complexity_classes

https://hal.science/hal-03691141v1/document

https://blog.wolframalpha.com/2011/02/21/complexity-classes-in-wolframalpha/

https://homepages.cwi.nl/~rdewolf/publ/qc/survey.pdf

https://ui.adsabs.harvard.edu/abs/arXiv:1408.6695

https://news.ycombinator.com/item?id=20317884

https://comp3.eu/20240719s.pdf

https://www.sciencedirect.com/topics/computer-science/complexity-class

https://www.nature.com/articles/s42005-023-01191-3

https://www.cs.umd.edu/~gasarch/papers/classcomp.pdf

http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8340/pdf/LIPIcs-ITCS-2018-37.pdf

https://epubs.siam.org/doi/10.1137/0214015

https://eccc.weizmann.ac.il/static/books/Derandomizing_some_number_theoretic_and_algebraic_algorithms/

http://www.numdam.org/item/10.1051/ita/2013038.pdf

https://users.math.cas.cz/~jerabek/papers/factor.pdf

https://users.cs.duke.edu/~elk27/bibliography/92/Ka92_latin.pdf

https://cs.uwaterloo.ca/events/seminar-algorithms-and-complexity-factoring-polynomials-given-as-arithmetic-branching-programs

http://www.fields.utoronto.ca/talks/Factoring-and-bounded-arithmetic

https://nestedsoftware.com/2018/12/18/big-o-prime-factors-and-pseudo-polynomial-time-55cp.69665.html

https://www.cs.bu.edu/faculty/homer/537/talks/nov19-notes.pdf

https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/groupFactoring.pdf

https://algs4.cs.princeton.edu/66intractability/

http://www.villesalo.com/article/CoCFaEfCSSoR2.pdf

https://aimath.org/pastworkshops/polyfactorrep.pdf

https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=97a44cee4dd7182e2f1acc82a374d0b312a92fad

https://wrap.warwick.ac.uk/id/eprint/54707/1/WRAP_Hart_S1446788712000146a.pdf

https://www.cs.cmu.edu/~odonnell/quantum15/lecture23.pdf

https://www.math.fsu.edu/~hoeij/papers/issac11/A.pdf

https://www.cs.tau.ac.il/~shpilka/publications/ForbesShpilka-SIGACT.pdf