Repository navigation
Conversation
Lsonic233
changed the title
Lsonic233
changed the title
Lsonic233
force-pushed
the
query-complexity-decision-trees
branch
from
September 22, 2026 21:08
9e51ebd to
f85dc03
Compare
… Tree Complexity). Defines sensitivity, block sensitivity and certificate complexity.
Lsonic233
force-pushed
the
query-complexity-decision-trees
branch
2 times, most recently
from
October 5, 2026 12:49
2793780 to
f85dc03
Compare
Lsonic233
force-pushed
the
query-complexity-decision-trees
branch
from
October 5, 2026 13:43
f85dc03 to
a55b1fd
Compare
Lsonic233
marked this pull request as ready for review
October 5, 2026 13:44
Lsonic233
requested review from
SamuelSchlesinger,
arademaker,
chenson2018,
crei,
fmontesi and
sorrachai
as code owners
October 5, 2026 13:44
Collaborator
|
Thanks, the definitions match Jukna's Chapter 14 exactly and Rather than a list of comments I put my suggestions in that PR against your branch, so you can discuss them on the diff and merge whatever you agree with; that updates this PR automatically. The two with any weight are recording queries as a |
Collaborator
|
I pushed the merge with main (just the rebase plus the five renames) onto your branch, so Lsonic233#1 now shows only the proposed changes. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR defines deterministic decision trees and decision tree complexity. It completes the chain of inequalities : s(f) ≤ bs(f) ≤ C(f) ≤ D(f) ≤ n.