Toggle navigation
Publications
Researchers
Institutions
0
Sign In
Federated Authentication
(Click on the image)
Local Sign In
Password Recovery
Register
Sign In
Publications
Search
Statistics
Lower Bounds for Elimination via Weak Regularity
AuthID
P-00N-9S9
5
Author(s)
Chattopadhyay, A
·
Dvorák, P
·
Koucký, M
·
Loff, B
·
Mukhopadhyay, S
2
Editor(s)
Heribert Vollmer; Brigitte Vallée
Document Type
Proceedings Paper
Year published
2017
Published
in
34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany
in
LIPIcs,
ISSN: 1868-8969
Volume: 66, Pages: 21:1-21:14
Conference
34Th Symposium on Theoretical Aspects of Computer Science, Stacs 2017,
Date:
8 March 2017 through 11 March 2017
Indexing
Scopus
®
Dblp
®
/en/publications/view/698153
Google Scholar
®
Metadata
Sources
Publication Identifiers
DOI
:
10.4230/lipics.stacs.2017.21
DBLP
: conf/stacs/ChattopadhyayDK17
SCOPUS
: 2-s2.0-85016180461
Source Identifiers
ISSN
: 1868-8969
Export Publication Metadata
Export
×
Publication Export Settings
BibTex
EndNote
APA
Export Preview
Marked List
Add to Marked List
Info
At this moment we don't have any links to full text documens.
×
Select Source
This publication has:
2 records from
ISI
2 records from
SCOPUS
2 records from
DBLP
2 records from
Unpaywall
2 records from
Openlibrary
2 records from
Handle
Please select which records must be used by Authenticus!
×
Preview Publications
© 2024 CRACS & Inesc TEC - All Rights Reserved
Privacy Policy
|
Terms of Service