@incollection{,
	
					
					
					421E5D3406467CD3C5F6CC1D12C7E959
				,
	author={{Zulfia A.Chotchaeva} and {Moscow State University}},
	journal={{Global Journal of Computer Science and Technology}},
	journal={{GJCST}}0975-41720975-435010.34257/gjcst,
	address={Cambridge, United States},
	publisher={Global Journals Organisation}213111
}

@book{b0,
	
	
		,
	author={{
			SAaronson
		}}
		,
	title={{P= ?NP. (PDF)}}
				
			,
	year={2017}
		
	

}

@incollection{b1,
	
	
		,
	title={{Reducing the complexity of reductions}}
		,
	author={{
			MAgrawal
		} and {
			EAllender
		} and {
			RImpagliazzo
		} and {
			TPitassi
		} and {
			SRudich
		}}
		
		
		
		
	
	
		,
	journal={{Basil. Computational complexity}}
		
			10
			
			,
	year={2001. 2001}
			,
	publisher={Birkhauser Verlag}
		
	
	,
	note={PDF}

}

@book{b2,
	
	
		,
	title={{Computational complexity: a modern approach}}
		,
	author={{
			SArora
		} and {
			BBarak
		}}
		
		
			,
	year={2009}
			,
	publisher={Cambridge University Press}
		
	

}

@book{b3,
	
	
		,
	title={{Computability and logic}}
		,
	author={{
			GSBoolos
		} and {
			JPBurgess
		} and {
			RCJeffrey
		}}
		
		
		
			,
	year={2007}
			,
	publisher={Cambridge University Press}
		
	

}

@book{b4,
	
	
		,
	title={{The intrinsic computational difficulty of functions}}
		,
	author={{
			ACobham
		}}
		
			,
	year={1965}
			,
	publisher={PDF}
		
	

}

@book{b5,
	
	
		,
	title={{Introduction to algorithms}}
		,
	author={{
			ICormen
		} and {
			CLeiserson
		} and {
			RRivast
		} and {
			CStein
		}}
		
		
		
		
			,
	year={2009}
			,
	publisher={The MIT Press}
			,
	address={Cambridge, Massachusetts. London, England}
		
	
	,
	note={PDF}

}

@book{b6,
	
	
		,
	title={{The complexity of theoremproving procedures}}
		,
	author={{
			SACook
		}}
		
			,
	year={1971}
		
		
			University of Toronto. (PDF)
		
	

}

@book{b7,
	
	
		,
	author={{
			SACook
		}}
		,
	title={{The P versus NP Problem}}
				
			,
	publisher={Clay Mathematics Institute}
			,
	year={April 2000. 18 October 2006}
		
	

}

@book{b8,
	
	
		,
	title={{A compendium of NP optimization problems}}
		,
	author={{
			SBCooper
		}}
		,
	editor={U. K. (PDF) Crescenzi, P., & Kann, V.}
		
			,
	year={2004. 1994}
		
		
			Computability theory. University Leeds
		
	
	,
	note={PDF}

}

@incollection{b9,
	
	
		,
	title={{The new matrix model of computation based purely on quite a new concept of the matrix computations for extremely quick web pages loading}}
		,
	author={{
			ZAChotchaeva
		}}
	
	
		,
	journal={{Journal of Computer Science}}
		
			16
			11
			
			,
	year={2020}
		
	

}

@incollection{b10,
	
	
		,
	title={{A computing Procedure for Quantification theory}}
		,
	author={{
			MDavis
		} and {
			HPutnam
		}}
		
	
	
		,
	journal={{Journal of the ACM}}
		
			7
			,
	year={1959}
		
	

}

@incollection{b11,
	
	
		,
	title={{A Machine Program for theorem proving}}
		,
	author={{
			MDavis
		} and {
			GLogemann
		} and {
			DLoveland
		}}
		
		
	
	
		,
	journal={{Communications of the ACM}}
		
			5
			7
			,
	year={1961}
		
	

}

@incollection{b12,
	
	
		,
	title={{The status of the P vs NP}}
		,
	author={{
			LFortnow
		}}
	
	
		,
	booktitle={{Computers and Intractability}}
				,
	editor={
			MRGarey
			OSJohnson
		}
		San Francisco
		
			,
	publisher={freeman}
			,
	year={2009. 1979}
			52
			
		
	

}

@book{b13,
	
	
		,
	title={{Hilbert's Tenth Problem: Refinements and Variants}}
		,
	author={{
			WGasarch
		}}
		arXiv:2104.07220v2
		
			,
	year={2002}
		
	
	,
	note={math.LO}

}

@book{b14,
	
	
		,
	title={{On formally undecidable propositions of principia mathematics and related systems}}
		,
	author={{
			KG?del
		}}
		
			,
	year={1931}
		
	
	,
	note={PDF}

}

@book{b15,
	
	
		,
	author={{
			O; PGoldreich
		} and {
			NP
		} and {
			Np-Completeness
		}}
		
		
		,
	title={{The Basics of Computational Complexity}}
				
			,
	publisher={Cambridge University Press}
			,
	year={2010}
		
	

}

@book{b16,
	
	
		,
	title={{Bulletin of the European Association for Theoretical Computer Science}}
		,
	author={{
			JHartmanis
		}}
		
			,
	year={1989}
			38
			
		
	
	,
	note={Gödel, von Neumann, and the P=?NP problem}

}

@book{b17,
	
	
		,
	title={{Mathematical problems}}
		,
	author={{
			DHilbert
		}}
		
			,
	year={2000}
			,
	publisher={PDF}
			37
		
	

}

@book{b18,
	
	
		,
	title={{Introduction to automata theory, languages, and computations}}
		,
	author={{
			JEHopcroft
		} and {
			RMotwani
		} and {
			JDUllman
		}}
		
		
		
			,
	year={2001}
			,
	publisher={PDF}
		
	

}

@book{b19,
	
	
		,
	title={{Reducibility among Combinatorial Problems}}
		,
	author={{
			RMKarp
		}}
		10.1007/978-3-540-68279-0_8
		
			,
	year={1972. 2010}
			,
	publisher={Springer}
		
	

}

@book{b20,
	
	
		,
	title={{Algorithm design}}
		,
	author={{
			JKleinberg
		} and {
			ETardos
		}}
		
		
			,
	year={2005}
			,
	publisher={PDF}
		
		
			Cornell University
		
	

}

@incollection{b21,
	
	
		,
	title={{On the structure of Polynomialtime reducibility}}
		,
	author={{
			RELadner
		}}
	
	
		,
	journal={{Journal of the ACM}}
		
			23
			1
			,
	year={1975}
		
	

}

@incollection{b22,
	
	
		,
	title={{Some connections between nonuniform complexity classes}}
		,
	author={{
			RJLipton
		} and {
			R MKarp
		}}
		
	
	
		,
	booktitle={{Proceedings of the ACM}}
				the ACM
		
			,
	year={1980}
			
		
	

}

@book{b23,
	
	
		,
	title={{Lectures on the Curry-Howard Isomorphism}}
		,
	editor={Morten Heine B. Sorensen, & Pawel Urzyczyn}
		
			,
	year={1998}
		
		
			University of Copenhagen & Warsaw
		
	

}

@incollection{b24,
	
	
		,
	title={{Selected letters. History of mathematics}}
		,
	author={{
			VonJNeumann
		}}
	
	
		,
	booktitle={{Computational Complexity}}
				
			,
	publisher={Addison-Wesley}
			,
	year={2005. 1993}
			27
		
	
	,
	note={PDF) 26. Papadimitriou, C.}

}

@book{b25,
	
	
		,
	title={{Introduction to the Theory of Computation}}
		,
	author={{
			MSipser
		}}
		
			,
	year={2012}
		
	
	,
	note={Cengage learning}

}

@incollection{b26,
	
	
		,
	title={{Mathematical problems for the next century}}
		,
	author={{
			SSmale
		}}
		10.1007/BF03025291
	
	
		,
	journal={{The mathematical intelligencer}}
		
			20
			2
			,
	year={2000}
		
	

}

@incollection{b27,
	
	
		,
	title={{P versus NP problem}}
		,
	author={{
			Wikipedia
		}}
	
	
		,
	journal={{Wikipedia}}
		
			,
	year={2021}
		
	

}