Skip to content
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.

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

[WIP] New factoring #62

Merged
merged 18 commits into from
Aug 13, 2024
Merged

[WIP] New factoring #62

merged 18 commits into from
Aug 13, 2024

Conversation

GiggleLiu
Copy link
Owner

No description provided.

Copy link

codecov bot commented Aug 6, 2024

Codecov Report

Attention: Patch coverage is 81.33333% with 14 lines in your changes missing coverage. Please review.

Project coverage is 92.24%. Comparing base (dad2f9c) to head (98551a7).

Files Patch % Lines
src/rules/spinglass_sat.jl 7.69% 12 Missing ⚠️
src/rules/factoring_sat.jl 95.12% 2 Missing ⚠️
Additional details and impacted files
@@            Coverage Diff             @@
##             main      #62      +/-   ##
==========================================
- Coverage   92.93%   92.24%   -0.70%     
==========================================
  Files          26       28       +2     
  Lines        1076     1147      +71     
==========================================
+ Hits         1000     1058      +58     
- Misses         76       89      +13     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

@GiggleLiu GiggleLiu changed the title New factoring [WIP] New factoring Aug 6, 2024
# s + 2c = p*q + s_pre + c_pre
c = BooleanExpr(Symbol("c$i$j"))
s = BooleanExpr(Symbol("s$i$j"))
mul_exprs, ancillas = multiplier(s, c, p[i], q[j], j == n2 ? BooleanExpr(:false) : spres[j+1], cpre)
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

ERROR: BoundsError: attempt to access 0-element Vector{BooleanExpr} at index [2] since the spres and cpres are empty vector. So maybe initialize the vector by pushing zeros. But 0 (1) is not defined in BoolExpr, also the false & true

# res4 = reduceto(CircuitSAT, fact4)
# best_configs4 = findbest(target_problem(res4), BruteForce()) <- this step is slow and we can't get the result ,stucked. maybe improve it
# @test length(best_configs4) == 2

Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

check this plz

@GiggleLiu GiggleLiu merged commit 63a1579 into main Aug 13, 2024
3 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants