Complexity of the theory of p-adic numbers

Annual Symposium on Foundatons of Computer Science (Proceedings)

Volumn , Issue , 1993, Pages 412-421

  Egidi, Lavinia ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; AUTOMATA THEORY; DECISION THEORY; NUMBER THEORY; SET THEORY;

CELL DECOMPOSITION; LOWER BOUNDS; P-ADIC NUMBERS; SEMI ALGEBRAIC SETS;

COMPUTATIONAL COMPLEXITY;

EID: 0027806871     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)