commit 56104b63c2f72308b346ed66b732f08c829a46d3
parent 002cbd675f5a01d77a91da9fec2a028d16208294
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Tue, 27 May 2025 09:57:23 +0200
commit with codex
Diffstat:
3 files changed, 6 insertions(+), 1 deletion(-)
diff --git a/boolean_function b/boolean_function
@@ -30,3 +30,5 @@ Problems:
Up: [theoretical_computer_science]
See also: [communication_complexity]
+
+Aliases: Boolean functions
diff --git a/fp b/fp
@@ -2,4 +2,6 @@
The [complexity_class] of the [functions] computed by [deterministic_Turing_machines] in [polynomial_time]
+- [fpc]
+
Up: [complexity_class]
diff --git a/matrix b/matrix
@@ -17,7 +17,7 @@
- equivalently [matrix_invertible] over the integers
- [totally_unimodular]: matrix (not necessarily square) where every [matrix_square] [submatrix] (deleting rows and columns) has [determinant] 0 or 1 or -1
- [strongly_unimodular] matrix
-- [pet_matrix] https://cstheory.stackexchange.com/a/53156 [fertin2015obtaining]
+- [pet_matrix]
## Operations
@@ -28,6 +28,7 @@
- [matrix_rank]
- [determinant] and [permanent]
+- [trace]
## [computational_problem]
