Algorithms for Matrix Groups and the Tits Alternative. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/focs/Beals95>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Robert_Beals>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1995.492589>
foaf:homepage	<https://doi.org/10.1109/SFCS.1995.492589>
dc:identifier	DBLP conf/focs/Beals95 (xsd:string)
dc:identifier	DOI doi.org%2F10.1109%2FSFCS.1995.492589 (xsd:string)
dcterms:issued	1995 (xsd:gYear)
rdfs:label	Algorithms for Matrix Groups and the Tits Alternative. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Robert_Beals>
swrc:pages	593-602 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/focs/1995>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/focs/Beals95/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/focs/Beals95>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/focs/focs95.html#Beals95>
rdfs:seeAlso	<https://doi.org/10.1109/SFCS.1995.492589>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject	group theory; matrix algebra; computational complexity; encoding; decidability; formal logic; matrix groups; finitely generated linear group; nonabelian free group; solvable subgroup; finite index; polynomial time algorithm; finitely generated matrix group; algebraic number field; decidability; nonabelian free subgroups; complexity; homomorphism; nilpotent subgroup; encoding length; Las Vegas algorithm; membership testing; finite groups (xsd:string)
dc:title	Algorithms for Matrix Groups and the Tits Alternative. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document