( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
New Revision Algorithms.

, , , и . ALT, том 3244 из Lecture Notes in Computer Science, стр. 395-409. Springer, (2004)

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.

György Irmey

György Csanády

György Szikszay

György Iványi

György Jákli

 

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

Foreword., , и . Ann. Math. Artif. Intell., 79 (1-3): 1-3 (2017)Sorting and Recognition Problems for Ordered Sets., и . STACS, том 182 из Lecture Notes in Computer Science, стр. 109-118. Springer, (1985)On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In., и . J. Comput. Syst. Sci., 54 (1): 199-212 (1997)Finding bipartite subgraphs efficiently., и . Inf. Process. Lett., 110 (5): 174-177 (2010)Horn Belief Contraction: Remainders, Envelopes and Complexity., , , и . AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning, AAAI, (2011)Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201)., , , и . Dagstuhl Reports, 4 (5): 1-26 (2014)Improved Algorithms for Theory Revision with Queries., , , и . COLT, стр. 236-247. Morgan Kaufmann, (2000)Learning with Queries but Incomplete Information (Extended Abstract)., и . COLT, стр. 237-245. ACM, (1994)Two lower bounds for branching programs, , , , , , , и . STOC, стр. 30-38. ACM, (1986)Combinatorial Problems for Horn Clauses., , , и . Graph Theory, Computational Intelligence and Thought, том 5420 из Lecture Notes in Computer Science, стр. 54-65. Springer, (2009)