{"id":"W3112462397","doi":"10.23977/cpcs.2020.41003","title":"Procedure of Solving 3-SAT Problem by Combining Quantum Search Algorithm and DPLL Algorithm","year":2020,"lang":"en","type":"article","venue":"Computing Performance and Communication systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"DPLL algorithm; Algorithm; Quantum algorithm; Satisfiability; Quantum computer; Boolean satisfiability problem; Computer science; Simple (philosophy); Quantum sort; Qubit; Mathematics; Quantum; Theoretical computer science; Quantum error correction","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004895605,0.0005330294,0.000886048,0.00124938,0.001054886,0.0008210037,0.001351204,0.0005856759,0.00677833],"category_scores_gemma":[0.001133977,0.0003554457,0.0007617246,0.001533198,0.0005874114,0.001098432,0.001348581,0.00111475,0.001153556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008722778,"about_ca_system_score_gemma":0.002320685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006115262,"about_ca_topic_score_gemma":0.004762334,"domain_scores_codex":[0.9992498,0.0001268464,0.00006138691,0.0001655008,0.0002985326,0.00009806619],"domain_scores_gemma":[0.9997416,0.00006934378,0.00001942662,0.00005429708,0.0001008534,0.00001451389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002169341,0.0003170958,0.002346786,0.0007981448,0.0000934831,0.0002708646,0.0003177506,0.1468138,0.0261639,0.1100184,0.01832539,0.6943175],"study_design_scores_gemma":[0.0002208332,0.0001182137,0.0007120343,0.00005454409,0.00006409574,0.0003159901,0.0001222533,0.9010848,0.02520878,0.05269513,0.01935381,0.00004955661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007415936,0.0001581486,0.9821583,0.00023429,0.00003937005,0.0002728056,0.0001264018,0.001022831,0.008571926],"genre_scores_gemma":[0.177479,0.0003831049,0.8156682,0.0002546891,0.00005639159,0.000551925,0.00080788,0.0002637598,0.004534907],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00677833,"threshold_uncertainty_score":0.02267575,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01913256309218583,"score_gpt":0.2383248170325821,"score_spread":0.2191922539403963,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}