Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Abhranil Chatterjee 0001
Institute of Mathematical Sciences, Chennai, India - Abhranil Chatterjee 0002
System Sciences and Automation, Indian Institute of Science, Bangalore, India - Abhranil Chatterjee 0003
Flipkart Internet Pvt. Ltd, Koramangala, Bangalore, India
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 42 matches
- 2024
- Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk:
Determinants vs. Algebraic Branching Programs. ITCS 2024: 27:1-27:13 - Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. STOC 2024: 106-117 - Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Trading Determinism for Noncommutativity in Edmonds' Problem. CoRR abs/2404.07986 (2024) - Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Trading Determinism for Noncommutativity in Edmonds' Problem. Electron. Colloquium Comput. Complex. TR24: TR24-073 (2024) - 2023
- Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj:
Border Complexity of Symbolic Determinant Under Rank One Restriction. CCC 2023: 2:1-2:15 - Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya:
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. ITCS 2023: 6:1-6:23 - Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj:
Border Complexity of Symbolic Determinant under Rank One Restriction. CoRR abs/2305.09973 (2023) - Abhranil Chatterjee, Partha Mukhopadhyay:
The Noncommutative Edmonds' Problem Re-visited. CoRR abs/2305.09984 (2023) - Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk:
Determinants vs. Algebraic Branching Programs. CoRR abs/2308.04599 (2023) - Vikraman Arvind, Abhranil Chatterjee:
On Lifting Lower Bounds for Noncommutative Circuits using Automata. CoRR abs/2308.04854 (2023) - Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. CoRR abs/2309.15647 (2023) - Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk:
Determinants vs. Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR23 (2023) - Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj:
Border Complexity of Symbolic Determinant under Rank One Restriction. Electron. Colloquium Comput. Complex. TR23 (2023) - Vikraman Arvind, Abhranil Chatterjee:
On Lifting Lower Bounds for Noncommutative Circuits using Automata. Electron. Colloquium Comput. Complex. TR23 (2023) - Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Fast Exact Algorithms Using Hadamard Product of Polynomials. Algorithmica 84(2): 436-463 (2022) - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. Theory Comput. Syst. 66(1): 56-88 (2022) - Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-Box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial Time. APPROX/RANDOM 2022: 23:1-23:22 - Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time. CoRR abs/2202.05693 (2022) - Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya:
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. CoRR abs/2209.04797 (2022) - Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Equivalence Testing of Weighted Automata over Partially Commutative Monoids. MFCS 2021: 10:1-10:15 - 2020
- Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. Chic. J. Theor. Comput. Sci. 2020 (2020) - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. MFCS 2020: 10:1-10:14 - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids. CoRR abs/2002.08633 (2020) - 2019
- Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Efficient Black-Box Identity Testing for Free Group Algebras. APPROX-RANDOM 2019: 57:1-57:16 - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Fast Exact Algorithms Using Hadamard Product of Polynomials. FSTTCS 2019: 9:1-9:14 - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. ISAAC 2019: 38:1-38:13 - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Efficient Black-Box Identity Testing over Free Group Algebra. CoRR abs/1904.12337 (2019) - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. CoRR abs/1908.08347 (2019)
skipping 12 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-06-20 16:11 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint