Search results
From MaRDI portal
- 2023-04-12 Paper Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* 2021-10-25 Paper Complexity assessments for...10 bytes (16 words) - 10:07, 25 September 2023
- preferences 2020-04-01 Paper Parameterized complexity in the polynomial hierarchy. Extending parameterized complexity theory to higher levels of the hierarchy 2020-01-21...10 bytes (18 words) - 21:48, 24 September 2023
- Streamlined subrecursive degree theory 2012-03-29 Paper Static Complexity Analysis of Higher Order Programs 2010-09-14 Paper Complexity classes and fragments of...10 bytes (16 words) - 23:19, 24 September 2023
- vertex set properties are efficiently enumerable 2021-09-15 Paper A complexity theory for hard enumeration problems 2019-09-19 Paper https://portal.mardi4nfdi...10 bytes (16 words) - 15:29, 6 October 2023
- Anisotropic complexity-free models in modified \(f(\mathbf{R},\mathbf{T})\) theory 2024-02-07 Paper Charged anisotropic models with complexity-free condition...10 bytes (16 words) - 03:20, 25 September 2023
- Publication Date of Publication Type On the complexity of communication complexity 2015-02-04 Paper Private approximation of search problems 2014-11-25...10 bytes (16 words) - 09:30, 7 October 2023
- parameterized complexity theory 2006-04-06 Paper Parameterized and Exact Computation 2005-08-23 Paper Machine-based methods in parameterized complexity theory 2005-06-30...10 bytes (16 words) - 03:30, 7 October 2023
- Publication Date of Publication Type On parallel complexity of analytic functions 2013-12-19 Paper On the Complexity of the Pancake Problem 2013-05-10 Paper Jordan...10 bytes (16 words) - 14:43, 6 October 2023
- holography 2022-11-25 Paper Action complexity in the presence of defects and boundaries 2022-10-27 Paper Spin matrix theory in near \(\frac{1}{8}\)-BPS corners...10 bytes (16 words) - 17:24, 24 September 2023
- self-reducibility; computational complexity theory Mathematics Subject Classification ID 68Q25: Analysis of algorithms and problem complexity Related Items The Helping...15 bytes (40 words) - 14:53, 6 February 2024
- abstract complexity theory; Blum's complexity theory; Kolmogorov's complexity theory; LOOP-hierarchy; LOOP-language; Martin-Löf's complexity theory; Subrecursive...15 bytes (210 words) - 07:27, 31 January 2024
- zbMATH Keywords computational complexity; NP-complete; nonstandard models of arithmetic; complexity theory; Complexity theory; reducibilities; polynomial...15 bytes (55 words) - 16:17, 5 February 2024
- oracles; structural complexity theory Mathematics Subject Classification ID 68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)...15 bytes (53 words) - 14:56, 6 February 2024
- org/abs/1907.12287 zbMATH Keywords algebraic complexity theory; Valiant's classes; parameterized complexity theory Mathematics Subject Classification ID 68Q25:...15 bytes (59 words) - 06:58, 7 March 2024
- 1989 Published in: Mathematical Systems Theory (Search for Journal in Brave) zbMATH Keywords complexity theory; one-way functions; public-key crypto-systems...15 bytes (57 words) - 17:13, 5 February 2024
- algorithms; complexity classes; complexity theory goals and primitives; informatics versus physics; information and physics; Quantum complexity theory Mathematics...15 bytes (60 words) - 18:17, 7 February 2024
- in complexity theory, A tight relationship between generic oracles and type-2 complexity theory, A survey of one-way functions in complexity theory...15 bytes (133 words) - 00:55, 31 January 2024
- Publication date: 5 April 1999 zbMATH Keywords complexity theory; finite model theory; descriptive complexity theory; reducibilities; Lindström quantifier; oracle...15 bytes (83 words) - 17:01, 6 February 2024
- and measure in abstract complexity theory Cites Work A note on A.E. h-complex functions Theories of computational complexity Theory of Formal Systems. (AM-47)...15 bytes (175 words) - 13:48, 31 January 2024
- computational complexity; complexity theory; recursive functions Mathematics Subject Classification ID 68Q25: Analysis of algorithms and problem complexity 03D15:...15 bytes (97 words) - 17:59, 30 January 2024
