Ground reducibility is EXPTIME-complete

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 1997, Pages 26-34

  Comon, Hubert ^a   Jacquemard, Florent ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; FORMAL LOGIC; POLYNOMIALS; THEOREM PROVING; TURING MACHINES;

GROUND REDUCIBILITY;

COMPUTATIONAL COMPLEXITY;

EID: 0030721922     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)