Search results
From MaRDI portal
- knapsack; real complexity; sparse sets Mathematics Subject Classification ID 68Q15: Complexity classes (hierarchies, relations among complexity classes, etc...15 bytes (73 words) - 01:49, 30 January 2024
- Journal of Complexity (Search for Journal in Brave) zbMATH Keywords information-based complexity; verification complexity; computation complexity; worst-case...15 bytes (100 words) - 06:47, 31 January 2024
- Journal of Complexity (Search for Journal in Brave) zbMATH Keywords Banach space; information-based complexity; Gaussian measure; worst case complexity; error...15 bytes (136 words) - 06:47, 31 January 2024
- Computational complexity; Software metrics Mathematics Subject Classification ID 68Q15: Complexity classes (hierarchies, relations among complexity classes,...15 bytes (63 words) - 14:59, 31 January 2024
- sparse sets; Turing complexity theory Mathematics Subject Classification ID 68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)...15 bytes (194 words) - 04:01, 1 February 2024
- communication complexity Mathematics Subject Classification ID 68Q30: Algorithmic information theory (Kolmogorov complexity, etc.) Cites Work Communication...15 bytes (76 words) - 10:44, 31 January 2024
- (hierarchies, relations among complexity classes, etc.) Cites Work Computational complexity of art gallery problems Unnamed Item...15 bytes (87 words) - 03:33, 8 February 2024
- probabilistic complexity class Mathematics Subject Classification ID 68Q25: Analysis of algorithms and problem complexity 03D15: Complexity of computation...15 bytes (93 words) - 03:25, 6 February 2024
- Classification ID 68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.) Cites Work The complexity of computing the permanent...15 bytes (100 words) - 10:55, 31 January 2024
- (Kolmogorov complexity, etc.) 15A03: Vector spaces, linear dependence, rank, lineability 94A05: Communication theory Cites Work Communication complexity in lattices...15 bytes (104 words) - 13:35, 31 January 2024
- 03D15: Complexity of computation (including implicit computational complexity) 26E10: (C^infty)-functions, quasi-analytic functions Cites Work Computational...15 bytes (103 words) - 03:48, 1 February 2024
- Kolmogorov complexity; dual complexity measures Mathematics Subject Classification ID 68Q30: Algorithmic information theory (Kolmogorov complexity, etc.) Cites...15 bytes (103 words) - 02:19, 6 February 2024
- Communication theory Cites Work Communication complexity Lower bounds on communication complexity Some bounds on multiparty communication complexity of pointer jumping...15 bytes (120 words) - 01:52, 30 January 2024
- ) Cites Work Communication complexity of the Gaussian elimination algorithm on multiprocessors Communication complexity of convex optimization Minimax models...15 bytes (124 words) - 02:50, 1 February 2024
- application in communication complexity Cites Work Communication complexity of two decision problems Deterministic communication complexity of set intersection...15 bytes (131 words) - 13:35, 31 January 2024
- computation of the permanent of a sparse matrix Cites Work The complexity of computing the permanent The complexity of combinatorial problems with succinct input...15 bytes (134 words) - 06:48, 31 January 2024
- power and complexity, The expressive powers of stable models for bound and unbound DATALOG queries Uses Software Datalog Cites Work The complexity of facets...15 bytes (142 words) - 15:03, 31 January 2024
- algorithms and problem complexity 03D15: Complexity of computation (including implicit computational complexity) Cites Work The complexity of computing the permanent...15 bytes (156 words) - 02:27, 1 February 2024
- (including implicit computational complexity) 68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.) Related Items Helping by unambiguous...15 bytes (154 words) - 02:30, 6 February 2024
- ID 68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.) Related Items A Sperner lemma complete for PPA Cites Work Query complexity...15 bytes (157 words) - 10:52, 31 January 2024