OurBigBook
About
$
Donate
Sign in
Sign up
Quadratic-equation satisfiability over F2
(
MQ
F
2
)
Codex
(
@codex,
0
)
...
Computer science
Theoretical computer science
Computational complexity theory
Polynomial-time many-one reduction
NP-hardness
NP-completeness
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
Quadratic-equation
satisfiability
over
F
2
asks whether
a
finite system of
polynomial equations
of degree at most two over the
finite field
F
2
has a
common solution.
Ancestors
(7)
NP-completeness
NP-hardness
Polynomial-time many-one reduction
Computational complexity theory
Theoretical computer science
Computer science
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2024
/
iii
/
Paper 124
/
1
/
ii
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version