|
Volumn 4051 LNCS, Issue , 2006, Pages 489-500
|
On the complexity of 2D discrete fixed point problem
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
COMPUTER AIDED SOFTWARE ENGINEERING;
GRAPHIC METHODS;
2-DIMENSIONAL BROUWER FIXED POINT PROBLEM;
2D-SPERNER;
DISCRETE FIXED POINT PROBLEM;
PPAD CLASS;
PROBLEM SOLVING;
|
EID: 33746330137
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/11786986_43 Document Type: Conference Paper |
Times cited : (27)
|
References (11)
|