default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 130
Volume 130, Number 1, 8 August 2003
- Iris Anshel, Michael Anshel, Dorian Goldfeld:
Non-abelian key agreement protocols. 3-12 - Seigo Arita:
An addition algorithm in Jacobian of Cab curves. 13-31 - Sang Geun Hahn, Eonkyung Lee
, Je Hong Park:
Complexity of the generalized conjugacy problem. 33-36 - Jeffrey Hoffstein, Joseph H. Silverman:
Random small Hamming weight products with applications to cryptography. 37-49 - Takakazu Satoh, Yuichiro Taguchi:
Computing zeta functions for ordinary formal groups over finite fields. 51-60 - Edlyn Teske:
Computing discrete logarithms with the parallelized kangaroo method, . 61-82
Volume 130, Number 2, 15 August 2003
- Hans van Maaren:
Preface. 83-84 - Renato Bruni:
Approximating minimal unsatisfiable subformulae by means of adaptive core search. 85-100 - Claudia Fiorini, Enrico Martinelli, Fabio Massacci:
How to fake an RSA signature by encoding modular root finding as a SAT problem. 101-127 - John V. Franco, Ramjee P. Swaminathan:
On good algorithms for determining unsatisfiability of propositional formulas. 129-138 - Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith:
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. 139-155 - Jan Friso Groote, Hans Zantema:
Resolution and binary decision diagrams cannot simulate each other polynomially. 157-171 - Edward A. Hirsch:
Worst-case study of local search for MAX-k-SAT. 173-184 - Hans Kleine Büning, Xishun Zhao:
On the structure of some classes of minimal unsatisfiable formulas. 185-207 - Oliver Kullmann:
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets. 209-249 - Chu Min Li:
Equivalent literal propagation in the DLL procedure. 251-276 - Chu Min Li, Sylvain Gérard:
On the limit of branching rules for hard random unsatisfiable 3-SAT. 277-290 - David A. Plaisted, Armin Biere, Yunshan Zhu:
A satisfiability procedure for quantified Boolean formulae. 291-328 - Steven D. Prestwich:
SAT problems with chains of dependent variables. 329-350 - Stefan Szeider:
Homomorphisms of conjunctive normal forms. 351-365
Volume 130, Number 3, 23 August 2003
- Rainer E. Burkard, Peter Butkovic:
Finding all essential terms of a characteristic maxpolynomial. 367-380 - Gregory M. Constantine:
Graphs, networks, and linear unbiased estimates. 381-393 - José Gómez, Ignacio M. Pelayo, Camino Balbuena:
Diameter vulnerability of GC graphs. 395-416 - Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki:
Interior and exterior functions of positive Boolean functions. 417-436 - Juan A. Mesa, Justo Puerto, Arie Tamir:
Improved algorithms for several network location problems with equality measures. 437-448 - Heng Yang, Yinyu Ye, Jiawei Zhang:
An approximation algorithm for scheduling two parallel machines with capacity constraints. 449-467 - Heping Zhang, Peter Che Bor Lam, Wai Chee Shiu:
Cell rotation graphs of strongly connected orientations of plane graphs with an application. 469-485 - Anne-Elisabeth Baert, Vlady Ravelomanana, Loÿs Thimonier:
On the growth of components with non-fixed excesses. 487-493 - Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Which matrices are immune against the transportation paradox? 495-501 - Charles Delorme, Odile Favaron, Dieter Rautenbach:
Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees. 503-512 - Peter C. Fishburn, Fred S. Roberts:
No-hole L(2, 1)-colorings. 513-519 - Vesa Halava, Tero Harju, Juhani Karhumäki:
Decidability of the binary infinite Post Correspondence Problem. 521-526 - Gwang-Yeon Lee, Jin-Soo Kim, Seong-Hoon Cho:
Some combinatorial identities via Fibonacci numbers. 527-534 - Enzo Maria Li Marzi:
Perfect 7-cycle systems. 535-538
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-12 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
