Article

Free access

Satisfiability of equations in free groups is in PSPACE

Author:

Claudio GutiérrezAuthors Info & Claims

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

Pages 21 - 27

https://doi.org/10.1145/335305.335308

Published: 01 May 2000 Publication History

PDF eReader

References

[1]

V. Diekert, Personal communication, 8 Oct. 1999.

Google Scholar

[2]

V. Durnev, Studying Algorithmic Problems for Free Semi-groups and Groups, Proceedings of the 4th International Symposium in Logical Foundations of Computer Science, Yaroslavl 1997. LNCS 1234.

Digital Library

Google Scholar

[3]

C. Guti(~rrez, Satisfiability of Word Equations with Constants is in Exponential Space, in Proceedings FOCS'98, IEEE Computer Soc. Press, Palo Alto, California, 1998.

Digital Library

Google Scholar

[4]

C. Guti~rrez, Equations in free Semigroups with antiinvolution and their relation to equations in free Groups, Proceedings of Latin American Theoretical INformatics, LATIN'2000, to appear in LNCS 1776. Also available as Technical Report MA-99-B-474, Departamento de Ingenierfa Matem~tica, Universidad de Chile; and in http://www, wesleyan, edu/~ cgut ierrez/stocO0, ps

Digital Library

Google Scholar

[5]

Y.I. Kmelevskii, Equations in a free semigroup, Trudy Mat. Inst. Steklov 107(1971); English trans. Proc. Steklov Inst. Math. 107(1971).

Google Scholar

[6]

Y.I. Kmelevskii, Systems of equations in a free group I, Izv. Akad. Nauk. SSSR Ser. Mat. 35(1971), 1237-1268; English trans, in Math USSR Izv. 5(1971).

Google Scholar

[7]

Y.I. Kmelevskii, Systems of equations in a free group II, Izv. Akad. Nauk. SSSR Set. Mat. 36(1972), 110-179; English trans, in Math USSR Izv. 6(1972).

Google Scholar

[8]

A. Ko~cielski, L. Pacholski, Complexity of Makanin's algorithm, J. Assoc. Comput. Mach. 43 (1996) 670-684.

Digital Library

Google Scholar

[9]

A. Ko~cielski, L. Pacholski, Makanin's algorithm is not primitive recursive, Theoretical Computer Science 191 (1998) 145-156.

Digital Library

Google Scholar

[10]

A.A. Lorents, Representation of solution sets of systems of equations with one unknown in free groups, Dokl. Akad. Nauk SSSR 178(1968), 290-292; English trans, in Soviet Math. Dokl. 9 (1968).

Google Scholar

[11]

Lothaire, M. Combinatorics on Words, Cambridge Mathematical Texts, reprinted 1998.

Google Scholar

[12]

R.C. Lyndon, Equations in free groups, Trans. Amer. Math. Soc. 96(1960), 445-457.

Crossref

Google Scholar

[13]

G.S. Makanin, The problem of solvability of equations in a free semigroup, Mat. Sbornik 103, 147-236 (in Russian). English translation in Math. USSR Sbornik 32, 129-198.

Google Scholar

[14]

G.S. Makanin. Equations in a free group, Izvestiya NA SSSR 46(1982), 1199-1273; English translation in Math USSR Izvestiya, 21 (1983), 483-546.

Google Scholar

[15]

G.S. Makanin. Decidability of the universal and positive theories of a free group, Izvestiya NA SSSR 48(1984), 735-749; English translation in Math USSR Izvestiya, 25 (1985), 75-88.

Google Scholar

[16]

W. Rytter and W. Plandowski, Applications of Lempel- Ziv encodings to the solution of word equations, in Proceedings of the 25th. ICALP, 1998.

Digital Library

Google Scholar

[17]

Plandowski, W., $atisfiability of word equations with constants is in NEXPTIME, in Proc. STOC'99.

Digital Library

Google Scholar

[18]

Plandowski, W., $atisfiability of word equations with constants is in PSPA CE, in Proc. FOCS'99.

Digital Library

Google Scholar

[19]

A.A. Razborov, On systems of equations in a free group, Izvestiya AN SSSR 48 (1984) 779-832 (in Russian). English translation in Math. USSR Izvestiya 25 (1985) 115- 162.

Google Scholar

Cited By

View all

Diekert VElder M(2019)Solutions to Twisted Word Equations and Equations in Virtually Free GroupsInternational Journal of Algebra and Computation10.1142/S0218196720500198Online publication date: 8-Dec-2019
https://doi.org/10.1142/S0218196720500198
Kumar MBhalaji NSingh S(2018)An augmented approach for pseudo-free groups in smart cyber-physical systemCluster Computing10.1007/s10586-018-2353-2Online publication date: 10-Mar-2018
https://doi.org/10.1007/s10586-018-2353-2
Kharlampovich OMohajeri ATaam AVdovina A(2017)Quadratic equations in hyperbolic groups are NP-completeTransactions of the American Mathematical Society10.1090/tran/6829369:9(6207-6238)Online publication date: 13-Feb-2017
https://doi.org/10.1090/tran/6829
Show More Cited By

Index Terms

Satisfiability of equations in free groups is in PSPACE
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Computational complexity and cryptography
    1. Interactive proof systems
    2. Proof complexity
  2. Logic
    1. Proof theory

Recommendations

A satisfiability procedure for quantified boolean formulae
The renesse issue on satisfiability

We present a satisfiability tester QSAT for quantified Boolean formulae and a restriction QSAT_CNF of QSAT to unquantified conjunctive normal form formulae. QSAT makes use of procedures which replace subformulae of a formula by equivalent formulae. By a ...
Satisfiability of mixed Horn formulas

In this paper the class of mixed Horn formulas is introduced that contain a Horn part and a 2-CNF (conjunctive normal form) (also called quadratic) part. We show that SAT remains NP-complete for such instances and also that any CNF formula can be ...
Backjumping for quantified Boolean logic satisfiability

The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Many decision procedures have been proposed in the last few years, most of ...

Comments

Information & Contributors

Information

Published In

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

May 2000

756 pages

ISBN:1581131844

DOI:10.1145/335305

Chairmen:
Frances Yao,
Eugene Luks

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC00

Sponsor:

SIGACT

STOC00: The 32nd Annual ACM Symposium on Theory of Computing

May 21 - 23, 2000

Oregon, Portland, USA

Acceptance Rates

STOC '00 Paper Acceptance Rate 85 of 182 submissions, 47%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
335
Total Downloads

Downloads (Last 12 months)30
Downloads (Last 6 weeks)6

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Diekert VElder M(2019)Solutions to Twisted Word Equations and Equations in Virtually Free GroupsInternational Journal of Algebra and Computation10.1142/S0218196720500198Online publication date: 8-Dec-2019
https://doi.org/10.1142/S0218196720500198
Kumar MBhalaji NSingh S(2018)An augmented approach for pseudo-free groups in smart cyber-physical systemCluster Computing10.1007/s10586-018-2353-2Online publication date: 10-Mar-2018
https://doi.org/10.1007/s10586-018-2353-2
Kharlampovich OMohajeri ATaam AVdovina A(2017)Quadratic equations in hyperbolic groups are NP-completeTransactions of the American Mathematical Society10.1090/tran/6829369:9(6207-6238)Online publication date: 13-Feb-2017
https://doi.org/10.1090/tran/6829
Diekert VMartin FSénizergues GSilva P(2017)Equations Over Free Inverse Monoids with Idempotent VariablesTheory of Computing Systems10.1007/s00224-016-9693-161:2(494-520)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1007/s00224-016-9693-1
Diekert VJeź APlandowski W(2016)Finding all solutions of equations in free groups and monoids with involutionInformation and Computation10.1016/j.ic.2016.09.009251:C(263-286)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1016/j.ic.2016.09.009
Diekert V(2015)More Than 1700 Years of Word EquationsAlgebraic Informatics10.1007/978-3-319-23021-4_2(22-28)Online publication date: 9-Sep-2015
https://doi.org/10.1007/978-3-319-23021-4_2
Diekert VMartin FSénizergues GSilva P(2015)Equations over Free Inverse Monoids with Idempotent VariablesComputer Science -- Theory and Applications10.1007/978-3-319-20297-6_12(173-188)Online publication date: 23-Jun-2015
https://doi.org/10.1007/978-3-319-20297-6_12
Diekert VJeż APlandowski W(2014)Finding All Solutions of Equations in Free Groups and Monoids with InvolutionComputer Science - Theory and Applications10.1007/978-3-319-06686-8_1(1-15)Online publication date: 2014
https://doi.org/10.1007/978-3-319-06686-8_1
Lohrey MLohrey M(2014)OutlookThe Compressed Word Problem for Groups10.1007/978-1-4939-0748-9_7(137-138)Online publication date: 12-Mar-2014
https://doi.org/10.1007/978-1-4939-0748-9_7
Levy JVillaret M(2009)Simplifying the signature in second-order unificationApplicable Algebra in Engineering, Communication and Computing10.5555/3112032.311227320:5-6(427-445)Online publication date: 1-Dec-2009
https://dl.acm.org/doi/10.5555/3112032.3112273
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A satisfiability procedure for quantified boolean formulae

Satisfiability of mixed Horn formulas

Backjumping for quantified Boolean logic satisfiability

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

A satisfiability procedure for quantified boolean formulae

Satisfiability of mixed Horn formulas

Backjumping for quantified Boolean logic satisfiability

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations