Suchergebnisse - "G.2.2 [discrete mathematics]: graph theory - graph algorithms"

Goodness of Fit Measures for Revealed Preference Tests: Complexity Results and Algorithms: Complexity Results and Algorithms

Autoren: Laurens Cherchye Frits C. R. Spieksma Bram De Rock et al.

Quelle: SSRN Electronic Journal

Schlagwörter: Sciences informatiques, Business & economic sciences, Goodness-of-fit measures, Economics, G.2.2 [discrete mathematics]: graph theory - graph algorithms, 16. Peace & justice, Computer science, Engineering, computing & technology, Ingénierie, informatique & technologie, Computational complexity, Revealed preference, Testing individual rationality, Microéconomie, Economie, Microeconomics, Sciences économiques & de gestion, Algorithms, F.2.0 [analysis of algorithms and problem complexity]: general, NP-complete

Dateibeschreibung: No full-text files; 1 full-text file(s): application/pdf

Zugangs-URL: https://lirias.kuleuven.be/bitstream/123456789/359169/1/KBI_1222.pdf
https://difusion.ulb.ac.be/vufind/Record/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/162939/Details
https://orbi.uliege.be/handle/2268/206625
http://home.agh.edu.pl/~faliszew/COMSOC-2012/proceedings/paper_11.pdf
https://dl.acm.org/doi/10.1145/2560793
https://dblp.uni-trier.de/db/journals/teco/teco2.html#SmeuldersSCR14
https://papers.ssrn.com/sol3/Delivery.cfm/SSRN_ID2165766_code444941.pdf?abstractid=2165766&mirid=3
https://papers.ssrn.com/sol3/papers.cfm?abstract_id=2165766
https://lirias.kuleuven.be/handle/123456789/359169
https://hdl.handle.net/2268/206625
https://doi.org/10.1145/2560793
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/132527

Goodness of fit measures for revealed preference tests: Complexity results and algorithms

Autoren: De Rock, Bram Smeulders, Bart Cherchye, Laurens et al.

Quelle: ACM transactions on economics and computation, 2 (1

Schlagwörter: Economie, Algorithms, Computational complexity, Economics, F.2.0 [analysis of algorithms and problem complexity]: general, G.2.2 [discrete mathematics]: graph theory - graph algorithms, Goodness-of-fit measures, NP-complete, Revealed preference, Testing individual rationality

Dateibeschreibung: No full-text files

Relation: uri/info:doi/10.1145/2560793; uri/info:scp/84991604155; uri/info:repec/RePEc:ulb:ulbeco:2013/162939

Verfügbarkeit: http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/162939

AND

Autoren: Ronald Fagin David Maier Mihalis Yannakakis et al.

Weitere Verfasser: Ronald Fagin David Maier Mihalis Yannakakis et al.

Quelle: http://www.almaden.ibm.com/cs/people/fagin/jacm83a.pdf.

Schlagwörter: Categories and Sub}ect Descriptors. F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic, G.2.2 [Discrete Mathematics]. Graph Theory--graph algorithms, trees, H.2.1 [Database Manage- ment, Logical Design--normal formy, schema and subschema, H.3.3 [Information Storage and Re- trieval, Information Search and Retneval--queryformulatwn General Terms Algorithms, Design, Languages, Management, Theory Additional Key Words and Phrases, Acyclicity, hypergraph, database scheme, relational database, multivalaed dependency

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.4653; http://www.almaden.ibm.com/cs/people/fagin/jacm83a.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.4653
http://www.almaden.ibm.com/cs/people/fagin/jacm83a.pdf