Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')
EuDML - The European Digital Mathematics Library

Login | Register | (Why Register?)

  • Home
  • Advanced Search
  • Browse by Subject
  • Browse by Journals
  • Refs Lookup
  • Subjects
  • 68-XX Computer science
  • 68Qxx Theory of computing
  • 68Q30 Algorithmic information theory (Kolmogorov complexity, etc.)

68Qxx Theory of computing

  • 68Q01 General
  • 68Q05 Models of computation (Turing machines, etc.)
  • 68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
  • 68Q12 Quantum algorithms and complexity
  • 68Q15 Complexity classes (hierarchies, relations among complexity classes, etc.)
  • 68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
  • 68Q19 Descriptive complexity and finite models
  • 68Q25 Analysis of algorithms and problem complexity
  • 68Q30 Algorithmic information theory (Kolmogorov complexity, etc.)
  • 68Q32 Computational learning theory
  • 68Q42 Grammars and rewriting systems
  • 68Q45 Formal languages and automata
  • 68Q55 Semantics
  • 68Q60 Specification and verification (program logics, model checking, etc.)
  • 68Q65 Abstract data types; algebraic specification
  • 68Q70 Algebraic theory of languages and automata
  • 68Q80 Cellular automata
  • 68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
  • 68Q87 Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
  • 68Q99 None of the above, but in this section
  • Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 1 of 1

Showing per page

ε -энтропия компактов в C и табулирование непрерывных функций.

В.Н. Потапов (1997)

Sibirskij matematiceskij zurnal

Currently displaying 1 – 1 of 1

Page 1

EuDML
  • About EuDML initiative
  • Feedback
  •  version 2.1.7