Остановите войну!
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
no matches
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 76 matches
- 2024
- Pritam Chandra, Ankit Garg, Neeraj Kayal, Kunal Mittal, Tanmay Sinha:
Learning Arithmetic Formulas in the Presence of Noise: A General Framework and Applications to Unsupervised Learning. ITCS 2024: 25:1-25:19 - 2023
- Nikhil Gupta, Chandan Saha, Bhargav Thankey:
Equivalence Test for Read-Once Arithmetic Formulas. SODA 2023: 4205-4272 - Pritam Chandra, Ankit Garg, Neeraj Kayal, Kunal Mittal, Tanmay Sinha:
Learning Arithmetic Formulas in the Presence of Noise: A General Framework and Applications to Unsupervised Learning. CoRR abs/2311.07284 (2023) - Pritam Chandra, Ankit Garg, Neeraj Kayal, Kunal Mittal, Tanmay Sinha:
Learning Arithmetic Formulas in the Presence of Noise: A General Framework and Applications to Unsupervised Learning. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- Ehud Cseresnyes, Hannes Seiwert:
Regular expression length via arithmetic formula complexity. J. Comput. Syst. Sci. 125: 1-24 (2022) - Bertrand Teguia Tabuguia:
Explicit formulas for concatenations of arithmetic progressions. CoRR abs/2201.07127 (2022) - Nikhil Gupta, Chandan Saha, Bhargav Thankey:
Equivalence Test for Read-Once Arithmetic Formulas. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- Peter Backeman, Philipp Rümmer, Aleksandar Zeljic:
Interpolating bit-vector formulas using uninterpreted predicates and Presburger arithmetic. Formal Methods Syst. Des. 57(2): 121-156 (2021) - Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
New Non-FPT Lower Bounds for Some Arithmetic Formulas. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- Ehud Cseresnyes, Hannes Seiwert:
Regular Expression Length via Arithmetic Formula Complexity. DCFS 2020: 26-38 - Ehud Cseresnyes, Hannes Seiwert:
Regular expression length via arithmetic formula complexity. CoRR abs/2012.15617 (2020) - 2017
- Li Chen, Yinrun Lyu, Chong Wang, Jingzheng Wu, Changyou Zhang, Nasro Min-Allah, Jamal Alhiyafi, Yongji Wang:
Solving linear optimization over arithmetic constraint formula. J. Glob. Optim. 69(1): 69-102 (2017) - Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan:
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. SIAM J. Comput. 46(1): 307-335 (2017) - Andrea Aquino, Giovanni Denaro, Mauro Pezzè:
Heuristically matching solution spaces of arithmetic formulas to efficiently reuse solutions. ICSE 2017: 427-437 - Toshiya Itoh, Yoshinori Takei:
Closed Formulas of the Arithmetic Mean Component Competitive Ratio for the 3-Objective and 4-Objective Time Series Search Problems. CoRR abs/1712.00214 (2017) - 2016
- Jay Jorgenson, Lejla Smajlovic, Holger Then:
Kronecker's Limit Formula, Holomorphic Modular Functions, and q-Expansions on Certain Arithmetic Groups. Exp. Math. 25(3): 295-320 (2016) - Thomas Macaulay Ferguson:
On Arithmetic Formulated Connexively. FLAP 3(3): 357-376 (2016) - Ilya Volkovich:
Characterizing Arithmetic Read-Once Formulae. ACM Trans. Comput. Theory 8(1): 2:1-2:19 (2016) - Arindam Mitra, Chitta Baral:
Learning To Use Formulas To Solve Simple Arithmetic Problems. ACL (1) 2016 - 2015
- Edinah K. Gnang, Maksym Radziwill, Carlo Sanna:
Counting arithmetic formulas. Eur. J. Comb. 47: 40-53 (2015) - Mrinal Kumar, Shubhangi Saraf:
The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In. SIAM J. Comput. 44(6): 1601-1625 (2015) - 2014
- Tim King:
Effective Algorithms for the Satisfiability of Quantifier-Free Formulas Over Linear Real and Integer Arithmetic. New York University, USA, 2014 - Ankit Gupta, Neeraj Kayal, Youming Qiao:
Random arithmetic formulas can be reconstructed efficiently. Comput. Complex. 23(2): 207-303 (2014) - Raúl Conejeros, Vassilios S. Vassiliadis, Thomas A. Pogiatzis:
Encoding Binary Arithmetic Operations in Integer Programming Formulations. J. Math. Model. Algorithms Oper. Res. 13(2): 143-167 (2014) - Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan:
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. FOCS 2014: 61-70 - Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan:
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas. STOC 2014: 119-127 - Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi:
A super-polynomial lower bound for regular arithmetic formulas. STOC 2014: 146-153 - Mrinal Kumar, Shubhangi Saraf:
The limits of depth reduction for arithmetic formulas: it's all about the top fan-in. STOC 2014: 136-145 - Edinah K. Gnang, Maksym Radziwill, Carlo Sanna:
Counting arithmetic formulas. CoRR abs/1406.1704 (2014) - Ilya Volkovich:
Characterizing Arithmetic Read-Once Formulae. CoRR abs/1408.1995 (2014)
skipping 46 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-04-24 20:40 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