Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,815,493 papers from all fields of science
Search
Sign In
Create Free Account
Programming complexity
Known as:
Code complexity
, Software complexity
Many measures of software complexity have been proposed. Many of these, although yielding a good representation of complexity, do not lend themselves…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Complexity
Cyclomatic complexity
Domain-driven design
Halstead complexity measures
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Quest: Effcient SPARQL-to-SQL for RDF and OWL
M. Rodriguez-Muro
,
J. Hardi
,
Diego Calvanese
International Workshop on the Semantic Web
2012
Corpus ID: 8571046
Motivation. One of the most important uses of semantic technology is that of Ontology Based Data Access (OBDA), where the…
Expand
2011
2011
Design of FlexRay-CAN gateway using node mapping method for in-vehicle networking systems
Jae-sung Yang
,
Suk Lee
,
K. Lee
,
Man-ho Kim
International Conference on Control, Automation…
2011
Corpus ID: 16270124
As vehicles become more intelligent, in-vehicle networking (IVN) systems, such as the controller area network (CAN) and the…
Expand
2010
2010
Multi-Agent System Protecting from Attacking with Elliptic Curve Cryptography
Xu Huang
,
P. Shah
,
D. Sharma
2010
Corpus ID: 57807796
Today’s software applications are mainly characterized by their component-based structures which are usually heterogeneous and…
Expand
2009
2009
A Validation Metrics Framework for safety-critical software-intensive Systems
K. Cruickshank
,
J. Michael
,
M. Shing
International Symposium on Service Oriented…
2009
Corpus ID: 2631950
As software complexity continues to increase in today's systems of systems, conveyance of stakeholder requirements, development…
Expand
2004
2004
Factoring and eliminating common subexpressions in polynomial expressions
Anup Hosangadi
,
F. Fallah
,
R. Kastner
IEEE/ACM International Conference on Computer…
2004
Corpus ID: 922257
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and…
Expand
2003
2003
A Component Approach for Robotics Software: Communication Patterns in the OROCOS Context
C. Schlegel
Autonome Mobile Systeme
2003
Corpus ID: 13111503
Vital functions of robots are provided by software and software dominance is still growing. Mastering the software complexity is…
Expand
Highly Cited
2001
Highly Cited
2001
Further results on interference cancellation and space-time block codes
A. Stamoulis
,
Naofal AI-Dhahir
,
A. R. Calderbank
Conference Record of Thirty-Fifth Asilomar…
2001
Corpus ID: 13958270
Space-time block codes (STBC) make use of a rich algebraic structure to provide diversity gains with small decoding complexity…
Expand
1997
1997
Maximizing diversity on block-fading channels
R. Knopp
,
P. Humblet
International Conference on Communications
1997
Corpus ID: 29810823
This work considers the achievable diversity for coded systems appropriately characterized by a block-fading channel model. We…
Expand
Highly Cited
1994
Highly Cited
1994
Modeling the relationship between source code complexity and maintenance difficulty
D. Lanning
,
T. Khoshgoftaar
Computer
1994
Corpus ID: 17850777
Canonical correlation analysis can be a useful exploratory tool for software engineers who want to understand relationships that…
Expand
1989
1989
Quadruple-step line generation
P. Bao
,
J. Rokne
Computers & graphics
1989
Corpus ID: 31306987
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE