Keyword:complexity classes

Papers
SAT is as Hard as Solving Homogeneous Diophantine Equation of Degree Two Frank Vega EasyChair Preprint no. 9354
NP on Logarithmic Space Frank Vega EasyChair Preprint no. 9555
On Feasibly Solving NP-Complete Problems Frank Vega EasyChair Preprint no. 11063
Sharp-P and the Birch and Swinnerton-Dyer Conjecture Frank Vega EasyChair Preprint no. 9368
Short Note on P vs NP Frank Vega EasyChair Preprint no. 7447
The Existence of One-Way Functions Frank Vega EasyChair Preprint no. 7282
Dense Complete Set For NP Frank Vega EasyChair Preprint no. 6893
P versus NP Frank Vega EasyChair Preprint no. 3061
The Complexity of Mathematics Frank Vega EasyChair Preprint no. 3062
A Mathematical Conjecture from P versus NP Frank Vega EasyChair Preprint no. 3415
The Complexity of the Twin Prime Conjecture Frank Vega EasyChair Preprint no. 3388
L Versus Parity-L Frank Vega EasyChair Preprint no. 3343