Keyword:polynomial time

Publications
Note for the P Versus NP Problem (II) Frank Vega EasyChair Preprint 13469
Note for the Millennium Prize Problems Frank Vega EasyChair Preprint 11927
Note for the P versus NP Problem Frank Vega EasyChair Preprint 11886
On Feasibly Solving NP-Complete Problems Frank Vega EasyChair Preprint 11063
NP on Logarithmic Space Frank Vega EasyChair Preprint 9555
Sharp-P and the Birch and Swinnerton-Dyer Conjecture Frank Vega EasyChair Preprint 9368
SAT is as Hard as Solving Homogeneous Diophantine Equation of Degree Two Frank Vega EasyChair Preprint 9354
Short Note on P vs NP Frank Vega EasyChair Preprint 7447
The Existence of One-Way Functions Frank Vega EasyChair Preprint 7282
Dense Complete Set For NP Frank Vega EasyChair Preprint 6893
A Mathematical Conjecture from P versus NP Frank Vega EasyChair Preprint 3415
P versus NP Frank Vega EasyChair Preprint 3061
Is it possible to unify sequential programs? Tatyana Novikova and Vladimir Zakharov In:UNIF 2013. 27th International Workshop on Unification