New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

The onehot bitstring problem #37

Open

GiggleLiu opened this issue Dec 28, 2024 · 0 comments

Labels

Collaborator

GiggleLiu commented Dec 28, 2024 •

edited

Loading

The number of candidate clauses grows exponentially fast as the number of variable grows.

julia> tbl = BranchingTable(10, [[UInt(1) << i] for i=0:9])
BranchingTable{UInt64}
0000000001
0000000010
0000000100
0000001000
0000010000
0000100000
0001000000
0010000000
0100000000
1000000000

julia> OptimalBranchingCore.candidate_clauses(tbl) |> length
1022

Is there a way to truncate this type of candidate clause spaces?

GiggleLiu added the discussion label

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment