HomeEPiC SeriesKalpa PublicationsPreprintsFor AuthorsFor Editors

Keyword:polynomial time

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
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
A Mathematical Conjecture from P versus NP
Frank Vega
EasyChair Preprint no. 3415
Is it possible to unify sequential programs?
Tatyana Novikova and Vladimir Zakharov
In:UNIF 2013. 27th International Workshop on Unification
Copyright © 2012-2023 easychair.org. All rights reserved.