Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer science --- Computational Complexity --- 681.3*I --- #TELE:SISTA --- 681.3*F13 --- Computing methodologies --- Complexity classes: complexity hierarchies machine-independent complexity reducibility and completeness relations among complexity classes relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*F13 Complexity classes: complexity hierarchies machine-independent complexity reducibility and completeness relations among complexity classes relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*I Computing methodologies --- Computational complexity --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computational complexity. --- Complexité de calcul (Informatique) --- Informatique --- Computer science. --- Algorithmique --- Algorithmes --- Complexite

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

681.3*F11 --- 681.3*F13 --- 681.3*F41 --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Mathematical logic --- Decidability (Mathematical logic) --- Health Sciences --- Life Sciences --- Immunology --- Pathology --- Computable functions --- Gödel's theorem --- Logic, Symbolic and mathematical --- Recursive functions

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Group theory --- Groupes, Théorie des --- Burnside, Problème de --- Burnside problem --- Groupes, Théorie des. --- Burnside, Problème de. --- Gödel's theorem --- Word problems (Mathematics) --- Théorème de Gödel --- Problèmes des mots (Mathématiques) --- Burnside, Problème de --- Congresses --- Congrès --- ELSEVIER-B EPUB-LIV-FT --- Burnside problem. --- Gödel's theorem --- Word problems (Mathematics). --- Congresses. --- 510.6 --- Groupes, Théorie des --- Décidabilité (logique mathématique) --- 510.6 Mathematical logic --- Mathematical logic --- Problems, Word (Mathematics) --- Story problems (Mathematics) --- Mathematics --- Gödel's incompleteness theorem --- Undecidable theories --- Arithmetic --- Completeness theorem --- Incompleteness theorems --- Logic, Symbolic and mathematical --- Number theory --- Decidability (Mathematical logic) --- Problem, Burnside --- Finite groups --- Foundations --- Generators --- Relations --- Group theory - Congresses --- Groupes (algebre) --- Structures algebriques --- Generateurs --- Probleme du mot --- Burnside, Problème de.