共 50 条
- [33] UNIVERSAL QUANTIFIERS AND TIME-COMPLEXITY OF RANDOM-ACCESS MACHINES MATHEMATICAL SYSTEMS THEORY, 1985, 18 (02): : 171 - 187
- [36] Separating deterministic from nondeterministic NOF multiparty communication complexity - (Extended abstract) AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 134 - +
- [38] Lower-bound time-complexity analysis of logic programs LOGIC PROGRAMMING - PROCEEDINGS OF THE 1997 INTERNATIONAL SYMPOSIUM, 1997, : 261 - 275