Biased initialization in random walk algorithms for k -SAT: a generalization of Schöning's method

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of parallel, emergent and distributed systems s. 1 - 21
Hlavní autoři: Ghosh, Subhas Kumar, Vittamsetti, Vijay Monic
Médium: Journal Article
Jazyk:angličtina
Vydáno: 04.07.2025
ISSN:1744-5760, 1744-5779
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Author Vittamsetti, Vijay Monic
Ghosh, Subhas Kumar
Author_xml – sequence: 1
  givenname: Subhas Kumar
  surname: Ghosh
  fullname: Ghosh, Subhas Kumar
– sequence: 2
  givenname: Vijay Monic
  surname: Vittamsetti
  fullname: Vittamsetti, Vijay Monic
BookMark eNpFkMtKAzEUhoNUsK0-gpCdq6lJJrdxV4s3EFy0roczk6SNnUkkGRB9MF_AF7PFqqv_wn_O4pugUYjBInROyYwSTS6p4lwoSWaMMDFjgilFxREa7_tCKFWN_rwkJ2iS8wshnHGpxqi59pCtwT74wUPnP2DwMewiThBM7PEbdFsM3TomP2z6jF1MeIuL5Xx1hQGvbbDp_yw6vGw3X5_Bh_VFxr0dNtGcomMHXbZnB52i59ub1eK-eHy6e1jMH4uWkXIoeMXAMA4gjQZqWi1KR5jWwvCSG9ZQSVzVCto6TitqoXFEU8N3c9lwq2U5ReLnb5tizsm6-jX5HtJ7TUm9B1X_gqr3oOoDqPIbTcRejQ
Cites_doi 10.1145/602382.602398
10.1007/11499107_16
10.1007/s00453-001-0094-7
10.1109/12.769433
10.1016/j.tcs.2004.08.002
10.1142/S0218213018400018
10.1007/11758471_9
10.1006/jcss.2000.1727
10.1007/978-3-540-79719-7_4
10.1109/SFCS.1991.185365
10.1016/j.jalgor.2004.04.012
10.1109/ACCESS.2023.3240468
10.1007/s11786-010-0036-3
10.1109/TETCI
10.1007/978-3-540-24749-4_13
10.1109/SFCS.1997.646146
10.1137/120868177
10.1007/s00037-024-00259-y
10.1016/0166-218X(85)90050-2
10.1109/ICCAD.1996.569607
10.1007/978-3-540-24605-3_12
10.1109/SFFCS.1999.814612
10.1016/0020-0190(79)90002-4
10.1016/S0304-3975(01)00174-8
10.1145/368273.368557
10.1145/800157.805047
10.1145/1066100.1066101
10.3233/SAT190005
10.1140/epjp/s13360-023-04390-7
10.1002/mma.v46.8
10.1109/SFCS.1998.743513
10.1016/S0304-3975(98)00017-6
10.1007/978-3-642-17517-6_9
10.1145/324133.324140
10.1137/1.9781611972757.2
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1080/17445760.2025.2527715
DatabaseName CrossRef
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1744-5779
EndPage 21
ExternalDocumentID 10_1080_17445760_2025_2527715
GroupedDBID .7F
.QJ
0BK
0R~
29J
30N
4.4
5GY
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
AAYXX
ABCCY
ABFIM
ABHAV
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFS
ACTIO
ADCVX
ADGTB
ADXPE
AEISY
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CITATION
CS3
DGEBU
DKSSO
EBS
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
LJTGL
M4Z
NA5
NX~
O9-
PQQKQ
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TNC
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
~S~
ID FETCH-LOGICAL-c203t-492ad24aa6d8a1dc853f02885d434d2b160f9c51cf4191eabf081d4a6d6b4e863
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001522169200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1744-5760
IngestDate Sat Nov 29 07:49:34 EST 2025
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c203t-492ad24aa6d8a1dc853f02885d434d2b160f9c51cf4191eabf081d4a6d6b4e863
PageCount 21
ParticipantIDs crossref_primary_10_1080_17445760_2025_2527715
PublicationCentury 2000
PublicationDate 2025-07-04
PublicationDateYYYYMMDD 2025-07-04
PublicationDate_xml – month: 07
  year: 2025
  text: 2025-07-04
  day: 04
PublicationDecade 2020
PublicationTitle International journal of parallel, emergent and distributed systems
PublicationYear 2025
References Dantsin E. (e_1_3_3_6_1) 1981; 105
e_1_3_3_30_1
Levin L. (e_1_3_3_3_1) 1973; 9
Feller W. (e_1_3_3_38_1) 1968
e_1_3_3_18_1
e_1_3_3_17_1
e_1_3_3_39_1
e_1_3_3_19_1
e_1_3_3_14_1
e_1_3_3_37_1
e_1_3_3_13_1
e_1_3_3_16_1
e_1_3_3_35_1
e_1_3_3_36_1
e_1_3_3_10_1
e_1_3_3_33_1
e_1_3_3_34_1
e_1_3_3_12_1
e_1_3_3_31_1
e_1_3_3_11_1
e_1_3_3_32_1
e_1_3_3_40_1
e_1_3_3_41_1
Hofmeister T (e_1_3_3_15_1) 2007; 40
e_1_3_3_7_1
e_1_3_3_9_1
e_1_3_3_8_1
e_1_3_3_29_1
e_1_3_3_28_1
e_1_3_3_25_1
e_1_3_3_24_1
e_1_3_3_27_1
e_1_3_3_26_1
e_1_3_3_21_1
e_1_3_3_44_1
e_1_3_3_2_1
e_1_3_3_20_1
e_1_3_3_45_1
e_1_3_3_5_1
e_1_3_3_23_1
e_1_3_3_42_1
e_1_3_3_4_1
e_1_3_3_22_1
e_1_3_3_43_1
References_xml – ident: e_1_3_3_4_1
  doi: 10.1145/602382.602398
– ident: e_1_3_3_23_1
  doi: 10.1007/11499107_16
– ident: e_1_3_3_10_1
  doi: 10.1007/s00453-001-0094-7
– ident: e_1_3_3_43_1
  doi: 10.1109/12.769433
– ident: e_1_3_3_22_1
  doi: 10.1016/j.tcs.2004.08.002
– ident: e_1_3_3_40_1
  doi: 10.1142/S0218213018400018
– ident: e_1_3_3_14_1
  doi: 10.1007/11758471_9
– ident: e_1_3_3_19_1
  doi: 10.1006/jcss.2000.1727
– ident: e_1_3_3_41_1
– ident: e_1_3_3_45_1
  doi: 10.1007/978-3-540-79719-7_4
– ident: e_1_3_3_37_1
  doi: 10.1109/SFCS.1991.185365
– ident: e_1_3_3_44_1
– ident: e_1_3_3_13_1
  doi: 10.1016/j.jalgor.2004.04.012
– ident: e_1_3_3_35_1
  doi: 10.1109/ACCESS.2023.3240468
– ident: e_1_3_3_18_1
  doi: 10.1007/s11786-010-0036-3
– ident: e_1_3_3_31_1
  doi: 10.1109/TETCI
– ident: e_1_3_3_24_1
– ident: e_1_3_3_12_1
  doi: 10.1007/978-3-540-24749-4_13
– ident: e_1_3_3_8_1
  doi: 10.1109/SFCS.1997.646146
– volume: 40
  start-page: 249
  issue: 3
  year: 2007
  ident: e_1_3_3_15_1
  article-title: Randomized algorithms for 3-SAT
  publication-title: Theor Comput Sci
– ident: e_1_3_3_28_1
  doi: 10.1137/120868177
– ident: e_1_3_3_30_1
  doi: 10.1007/s00037-024-00259-y
– ident: e_1_3_3_7_1
  doi: 10.1016/0166-218X(85)90050-2
– ident: e_1_3_3_42_1
  doi: 10.1109/ICCAD.1996.569607
– ident: e_1_3_3_39_1
  doi: 10.1007/978-3-540-24605-3_12
– ident: e_1_3_3_9_1
  doi: 10.1109/SFFCS.1999.814612
– volume-title: An introduction to probability theory and its applications
  year: 1968
  ident: e_1_3_3_38_1
– volume: 105
  start-page: 24
  year: 1981
  ident: e_1_3_3_6_1
  article-title: Two propositional proof systems based on the splitting method
  publication-title: Zapiski Nauchnykh Seminarov LOMI
– ident: e_1_3_3_26_1
– ident: e_1_3_3_29_1
– ident: e_1_3_3_5_1
  doi: 10.1016/0020-0190(79)90002-4
– ident: e_1_3_3_11_1
  doi: 10.1016/S0304-3975(01)00174-8
– ident: e_1_3_3_21_1
  doi: 10.1145/368273.368557
– ident: e_1_3_3_2_1
  doi: 10.1145/800157.805047
– ident: e_1_3_3_17_1
  doi: 10.1145/1066100.1066101
– ident: e_1_3_3_25_1
  doi: 10.3233/SAT190005
– ident: e_1_3_3_34_1
  doi: 10.1140/epjp/s13360-023-04390-7
– ident: e_1_3_3_36_1
  doi: 10.1002/mma.v46.8
– ident: e_1_3_3_16_1
  doi: 10.1109/SFCS.1998.743513
– ident: e_1_3_3_20_1
  doi: 10.1016/S0304-3975(98)00017-6
– ident: e_1_3_3_27_1
  doi: 10.1007/978-3-642-17517-6_9
– ident: e_1_3_3_32_1
  doi: 10.1145/324133.324140
– volume: 9
  start-page: 265
  issue: 3
  year: 1973
  ident: e_1_3_3_3_1
  article-title: Universal'nyie perebornyie zadachi (universal search problems: in russian)
  publication-title: Problemy Peredachi Informatsii, English Translation in [45]
– ident: e_1_3_3_33_1
  doi: 10.1137/1.9781611972757.2
SSID ssj0042467
Score 2.3327549
SecondaryResourceType online_first
SourceID crossref
SourceType Index Database
StartPage 1
Title Biased initialization in random walk algorithms for k -SAT: a generalization of Schöning's method
WOSCitedRecordID wos001522169200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Journals Complete
  customDbUrl:
  eissn: 1744-5779
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0042467
  issn: 1744-5760
  databaseCode: TFW
  dateStart: 20050301
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWwoELbwQUkA9IHKIsG8d5uLcWUXGqkFigt9X4kSbdNKk2obQ_iT_QP8AfYxwn2ywgRA9col1vPHnMt-OxPfMNIa-MiJicGenzVIDPVRz6kILws1iEYGlxlYGu2ERycJAeHooPk8n3IRfmrEyqKj0_F6f_VdXYhsq2qbPXUPdaKDbgZ1Q6HlHtePwnxe8VODBZRqUC_7xln2bZpa1ApesT7xuUSw_Ko3pVtLmjY_CWnv9xd-4Sn48cEfXQ0Sa1qNzup-_FVVcAJWn6utNjx3ZzZXHER2G5xcs-FsC4XE8X1K4tZa-ttoU324x4020wUF43uYsZkjk0XhcHPvxoN1XgpDGtC0T4XBzDRWea1HgFg0VdtCsfGd2Ecx_nPW5_xozbXKGZ3rgGo1HapVX_Zv9dwKTtbOVN7dWmLGJJ4nJGN_m2fxkH19GJQU-bOohZWDGLXswNcpMlkbAGdL7_ZRj0OeNdseL1owzJYunszR_vZuQGjfyZ-T1yp5-I0F0HoPtkYqoH5O5Q5IP2Nv8hkQ5PdBNP-JU6PFGLJ3qFJ4p4oktq8bRDgW6iidYZSs5_XFokvW6ow9Ej8mn_3fzte78vzOErNgtbnwsGmnGAWKcQaIUuX4Z-ahppHnLNZBDPMqGiQGU8EIEBmaHjqTmeHktu0jh8TLaqujJPCFU6wzeHkwodCTw5llJrKUVkVJyxAOApmQ7vaXHq-FcWf9XPs-t22Ca3r0D5nGy1q6_mBbmlztqiWb3stPwT5SR9aA
linkProvider Taylor & Francis
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Biased+initialization+in+random+walk+algorithms+for+k+-SAT%3A+a+generalization+of+Sch%C3%B6ning%27s+method&rft.jtitle=International+journal+of+parallel%2C+emergent+and+distributed+systems&rft.au=Ghosh%2C+Subhas+Kumar&rft.au=Vittamsetti%2C+Vijay+Monic&rft.date=2025-07-04&rft.issn=1744-5760&rft.eissn=1744-5779&rft.spage=1&rft.epage=21&rft_id=info:doi/10.1080%2F17445760.2025.2527715&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_17445760_2025_2527715
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1744-5760&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1744-5760&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1744-5760&client=summon