A conjunctive logical characterization of nondeterministic linear time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1414, Issue , 1998, Pages 360-372

  Olive, Frédéric ^a  

^a UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; RECONFIGURABLE HARDWARE; TEMPORAL LOGIC;

FIRST ORDER; FUNCTIONAL EQUATION; LINEAR TIME; LOGICAL CHARACTERIZATION; UNARY FUNCTIONS;

COMPUTER CIRCUITS;

EID: 84870171598     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028025     Document Type: Conference Paper

References (3)

1. E. Grandjean, F. Olive, Monadic logical definability of nondeterministic linear time, Journal of Computational Complexity, Vol. 7 (1998) (to appear).
2. R.M. Karp, Reducibility among combinatorial problems, IBM Symp, 1972, Complexity of Computers Computations, Plenum Press, New York, 1972.
3. F. Olive, Caracterisation Logique des problemes NP: Robustesse et Normalisation, These de Doctorat, 1996, Universite de Caen, Prance.