Elementary-algebraic interpretation of P vs NP

L. Gordeev, A. Krebs, Tübingen University

ElementaryInterpretations.pdf

Base B3 (Maple program/Text)

L. Gordeev, Tübingen University

B3Test.pdf

Proof-sketch: Why NP is not P

L. Gordeev, Tübingen University

ProofSketch.pdf

Combinatorial sentence that infers P < NP

L. Gordeev, Tübingen University
Talk at 4th International Workshop on Proof, Computation, Complexity (PCC'05), Lisboa, July 16-17, 2005.

Combinatorics.pdf

Strong WQO phase transitions, Oberwolfach-Abstract (2006)

L. Gordeev (Tübingen University), A. Weiermann (Utrecht University)

AbstractOberwolfach.pdf

Strong WQO phase transitions 1 (2006)

L. Gordeev (Tübingen University), A. Weiermann (Utrecht University)

PhaseTrans1D.pdf

Strong WQO phase transitions for (nested) labeled trees (2006)

L. Gordeev (Tübingen University), A. Weiermann (Utrecht University)

PhaseTransLabTrees.pdf

Testing nested labeled trees (2006)

L. Gordeev (Tübingen University), A. Weiermann (Utrecht University)

LabTreesTest1.pdf

A note on "Computing the future" by N. C. A. da Costa and F. A. Doria, talk at PUC Rio de Janeiro, January 2007

L. Gordeev (Tübingen University)

Costa-Doria-1.pdf

Proof compressions with circuit-structured substitutions (2007)

L. Gordeev, E. H. Haeusler (PUC Rio), V. G. da Costa (PUC Rio)

ProofCompress.pdf