au.\*:("PLAISTED D")
Results 1 to 16 of 16
Selection :
SOME POLYNOMIAL AND INTEGER DIVISIBILITY PROBLEMS ARE NP-HARDPLAISTED D.1978; S.I.A.M. J. COMPUTG; USA; DA. 1978; VOL. 7; NO 4; PP. 458-464; BIBL. 3 REF.Article
Complete divisibility problems for slowly utilized oraclesPLAISTED, D. A.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 245-260, issn 0304-3975Article
Complete problems in the first-order predicate calculusPLAISTED, D. A.Journal of computer and system sciences (Print). 1984, Vol 29, Num 1, pp 8-35, issn 0022-0000Article
Heuristic matching for graphs satisfying the triangle inequalityPLAISTED, D. A.Journal of algorithms (Print). 1984, Vol 5, Num 2, pp 163-179, issn 0196-6774Article
New NP-hard and NP-complete polynomial and integer divisibility problemsPLAISTED, D. A.Theoretical computer science. 1984, Vol 31, Num 1-2, pp 125-138, issn 0304-3975Article
Experimental results on subgoal reorderingXUMIN NIE; PLAISTED, D. A.IEEE transactions on computers. 1990, Vol 39, Num 6, pp 845-848, issn 0018-9340, 4 p.Article
A semantic backward chaining proof systemXUMIN NIE; PLAISTED, D. A.Artificial intelligence. 1992, Vol 55, Num 1, pp 109-128, issn 0004-3702Article
Refinements to depth-first iterative-deepening search in automatic theorem provingNIE, X; PLAISTED, D. A.Artificial intelligence. 1989, Vol 41, Num 2, pp 223-235, issn 0004-3702Article
COMPARISON OF NATURAL DEDUCTION AND LOCKING RESOLUTION IMPLEMENTATIONSGREENBAUM S; NAGASAKA A; O'RORKE P et al.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 138; PP. 159-171; BIBL. 16 REF.Conference Paper
The complexity of some complementation problemsPLAISTED, D. A; KUCHEROV, G.Information processing letters. 1999, Vol 71, Num 3-4, pp 159-165, issn 0020-0190Article
A model for the parallel execution of subset-equational languagesOMONDI, A. R; PLAISTED, D. A.FGCS. Future generations computer systems. 1995, Vol 11, Num 3, pp 295-320, issn 0167-739XArticle
Controlling the consumption of storage with sliding priority search in a hyper-linking based theorem proverLEE, S.-J; PLAISTED, D. A.Computers and artificial intelligence. 1995, Vol 14, Num 6, pp 563-578, issn 0232-0274Article
Evaluation of transgenic sweet corn hybrids expressing CryIA(b) toxin for resistance to corn earworm and fall armyworm (Lepidoptera: Noctuidae)LYNCH, R. E; WISEMAN, B. R; PLAISTED, D et al.Journal of economic entomology. 1999, Vol 92, Num 1, pp 246-252, issn 0022-0493Article
An algorithm for finding canonical sets of ground rewrite rules in polynomial timeGALLIER, J; NARENDRAN, P; PLAISTED, D et al.Journal of the Association for Computing Machinery. 1993, Vol 40, Num 1, pp 1-16, issn 0004-5411Article
Management of corn earworm and fall armyworm (Lepidoptera : Noctuidae) injury on a sweet corn hybrid expressing a cryIA(b) geneLYNCH, R. E; WISEMAN, B. R; SUMNER, H. R et al.Journal of economic entomology. 1999, Vol 92, Num 5, pp 1217-1222, issn 0022-0493Article
Restriction fragment length polymorphism markers associated with silk Maysin, antibiosis to corn earworm (Lepidoptera : Noctuidae) larvae, in a dent and sweet corn crossGUO, B. Z; ZHANG, Z. J; LI, R. G et al.Journal of economic entomology. 2001, Vol 94, Num 2, pp 564-571, issn 0022-0493Article