A criterion of polynomial lower bounds of combinational complexity

  • N. K. Kossovsky
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)


Boolean Function Turing Machine Boolean Network Propositional Formula Integer Coefficient 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Adachi A., Iwata S., Kasai T. Some combinatorial games Problems require Ω(nk) time. — J. Assoc.Comp.Mach.31 (1984),no.2,361–376.Google Scholar
  2. 2.
    Kossovsky N.K. Polynomial lower bounds for the complexity of establishing the solvability of logic-arithmetical equations (in Russion. English summary). — Ann.Univ.Sci.Budapestinensis Sect.Comput. 4,36–39 (1984).Google Scholar
  3. 3.
    Scarpellini B. Complex Boolean networks obtained by diagnoalization. — Theoret.comput.Sci. 36 (1985), no.1, 119–125.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • N. K. Kossovsky
    • 1
  1. 1.Math.-Mech. Faculty of Leningrad UniversityLeningradUSSR

Personalised recommendations