Algorithms in modern mathematics and computer science. Proceedings, Urgench, Uzbek SSR, September 16--22, 1979
zbMath0477.68035MaRDI QIDQ1161058
No author found.
Publication date: 1981
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
AlgorithmsProceedingsComputer sciencecomputation theoryexhaustive searchalgorithmic complexity of linear algebrasalgorithms and algebracomputability on algebraic structuresformal transformations of algorithmsgeneral and applied theory of algorithmsinductive and structural synthesis of programsinvariant relations of programslanguages of arithmeticlogical approach to programmingUrgench/UzSSR
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Decidability (number-theoretic aspects) (11U05) Constructive and recursive analysis (03F60) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Philosophical and critical aspects of logic and foundations (03A05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) History of mathematics in the Golden Age of Islam (01A30) Information theory (general) (94A15) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Word problems, etc. in computability and recursion theory (03D40) Other constructive mathematics (03F65) General topics in the theory of software (68N01) Recursively (computably) enumerable sets and degrees (03D25) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (3)
This page was built for publication: Algorithms in modern mathematics and computer science. Proceedings, Urgench, Uzbek SSR, September 16--22, 1979
