( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Covering Problem for Linear Context-Free Grammars.

, , и . Theor. Comput. Sci., 2 (3): 361-382 (1976)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Patrick Hunt

Walther Harry

Bruce Hunt

John Hunt

Bruce Hunt

 

Другие публикации лиц с тем же именем

Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report)., и . STACS, том 210 из Lecture Notes in Computer Science, стр. 277-290. Springer, (1986)I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract)., , , , и . PODC, стр. 122. ACM, (1996)Power Indices and Easier Hard Problems., и . Math. Syst. Theory, 23 (4): 209-225 (1990)Complexity Metatheorems for Context-Free Grammar Problems., и . J. Comput. Syst. Sci., 13 (3): 318-334 (1976)The Covering Problem for Linear Context-Free Grammars., , и . Theor. Comput. Sci., 2 (3): 361-382 (1976)Hierarchically Specified Unit Disk Graphs., , , и . Theor. Comput. Sci., 174 (1-2): 23-65 (1997)Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs., , и . ICCI, стр. 26-30. IEEE Computer Society, (1993)On the Computation of Detection Probability for Multiple Faults., и . ITC, стр. 252-262. IEEE Computer Society, (1986)The Complexity of Approximation PSPACE-Complete Problems for Hierarchical Specifications., , и . Nord. J. Comput., 1 (3): 275-316 (1994)Reachability problems for sequential dynamical systems with threshold functions., , , , , и . Theor. Comput. Sci., (2003)