Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
finite functions
Description:
Functions defined on finite sets, studied in mathematics including algebra, combinatorics, and theoretical computer science.
Related topics:
Computability, Logic, AI Algorithms (12%),
Mathematical Analysis and Transform Methods (9%)
Wikidata ID:
wiki/Q4484829
OpenAlex ID:
keywords/finite-functions
The Complexity of Finite Functions
1990
·
Ravi B. BOPPANA
, Michael SIPSER
·
Elsevier eBooks
·
266
The network complexity and the Turing machine complexity of finite functions
1976
·
C. P. Schnorr
·
Acta Informatica
·
101
Generalization of the Fundamental Theorem on Subadditive Functions
1962
·
J. M. Hammersley
·
Mathematical Proceedings of the Cambridge Philosophical Society
·
90
Galois theory for minors of finite functions
2002
·
Nicholas Pippenger
·
Discrete Mathematics
·
88
PDF
A theoretical study of fault coupling
2000
·
K. S. How Tai Wah
·
Software Testing Verification and Reliability
·
63
Functional morphology
2004
·
Markus Forsberg
, Aarne Ranta
·
ACM SIGPLAN Notices
·
57
Divisorial Valuations via Arcs
2008
·
Lawrence Ein
, Tommaso de Fernex
, et al.
·
Publications of the Research Institute for Mathematical Sciences
·
49
PDF
An analysis of the coupling effect I: single test data
2003
·
K.S. How Tai Wah
·
Science of Computer Programming
·
32
PDF
On closed sets of relational constraints and classes of functions closed under variable substitutions
2005
·
Miguel Couceiro
, Stephan Foldes
·
Algebra Universalis
·
30
PDF
The Theory of Composite Faults
2017
·
Rahul Gopinath
, Carlos Jensen
, et al.
·
IEEE International Conference on Software Testing, Verification and Validation (ICST)
·
26
On generalized constraints and certificates
2001
·
Lisa Hellerstein
·
Discrete Mathematics
·
26
PDF
Classifying patterns by automorphism group: An operator theoretic approach
1975
·
Dennis E. White
·
Discrete Mathematics
·
26
PDF
Harmonic Analysis of Functions on Semisimple Lie Groups. Ii
1969
·
D P Želobenko
·
Mathematics of the USSR-Izvestiya
·
26
Generalizations of Świerczkowski’s lemma and the arity gap of finite functions
2009
·
Miguel Couceiro
, Erkko Lehtonen
·
Discrete Mathematics
·
24
PDF
Functional morphology
2004
·
Markus Forsberg
, Aarne Ranta
·
ACM SIGPLAN International Conference on Functional Programming (ICFP)
·
23
Second-order moderate derivatives
1994
·
Philippe Michel
, Jean-Paul Penot
·
Nonlinear Analysis
·
18
An embedded declarative data transformation language
2009
·
Paul Tarau
·
International Symposium on Principles and Practice of Declarative Programming (PPDP)
·
15
On the Structure of Sequential Search: Beyond “No Free Lunch”
2004
·
Thomas English
·
Lecture notes in computer science
·
15
Time-Space Tradeoffs for Learning Finite Functions from Random Evaluations, with Applications to Polynomials
2018
·
Paul Beame
, Shayan Oveis Gharan
, et al.
·
Conference on Learning Theory
·
14
The extension of machine-independent computational complexity theory to oracle machine computation and to the computation of finite-functions.
1972
·
David Michael Symes
·
14
Binary Decision Diagrams
2010
·
Beate Bollig
, Martin Sauerhoff
, et al.
·
Cambridge University Press eBooks
·
13
Isomorphisms, hylomorphisms and hereditarily finite data types in Haskell
2009
·
Paul Tarau
·
ACM Symposium on Applied Computing
·
13
Decompositions of functions based on arity gap
2011
·
Miguel Couceiro
, Erkko Lehtonen
, et al.
·
Discrete Mathematics
·
12
PDF
Bethe-Salpeter equation at leading order in Coulomb gauge
2012
·
P. Watson
, H. Reinhardt
·
Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields
·
11
PDF
q-analogues of some bounded symmetric domains
2000
·
D.L. Shklyarov
, S.D. Sinel'shchikov
, et al.
·
Czechoslovak Journal of Physics
·
11
Show more works
View as search
Works count:
151
Citation count:
1,240
Year
Topic
Type